3204 search results - page 268 / 641 » The Alcuin Number of a Graph |
151
click to vote
ENDM
2008
15 years 6 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
166
click to vote
JCT
2006
15 years 6 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...
191
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
162
click to vote
FUZZIEEE
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...
176
click to vote
PKDD
2005
Springer
16 years 4 days ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...