Sciweavers

3204 search results - page 148 / 641
» The Alcuin Number of a Graph
Sort
View
CPC
2006
93views more  CPC 2006»
13 years 8 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
ENDM
2007
75views more  ENDM 2007»
13 years 8 months ago
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
Omer Giménez, Marc Noy, Juan José Ru...
EJC
2006
13 years 8 months ago
Symplectic graphs and their automorphisms
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
Zhongming Tang, Zhe-xian Wan
DAM
2006
124views more  DAM 2006»
13 years 8 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris
ORL
2008
115views more  ORL 2008»
13 years 8 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama