Sciweavers

3204 search results - page 219 / 641
» The Alcuin Number of a Graph
Sort
View
171
Voted
FCS
2009
15 years 3 months ago
Circuits as a Classifier for Small-World Network Models
The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Arno Leist, Kenneth A. Hawick
170
Voted
CORR
2011
Springer
184views Education» more  CORR 2011»
15 years 1 months ago
Acyclic and Star Colorings of Cographs
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
Andrew Lyons
GC
2008
Springer
15 years 6 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
MP
2006
81views more  MP 2006»
15 years 6 months ago
Almost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
Arnaud Pêcher, Annegret Wagler
149
Voted
ARSCOM
2008
65views more  ARSCOM 2008»
15 years 6 months ago
Strongly pan-factorial property in cages
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least number of vertices. In this note, we show that (k; g)-cage has an r-factor of girt...
Guizhen Liu, Qinglin Yu