28 search results - page 4 / 6 » On co-distance hereditary graphs |
78
Voted
JGT
2007
14 years 10 months ago
2007
JCT
2000
14 years 10 months ago
2000
CORR
2010
Springer
14 years 8 months ago
2010
Springer
It is well known that the spectral radius of a tree whose maximum degree is ∆ cannot exceed 2 √
JCT
2011
14 years 5 months ago
2011
WG
2004
Springer
15 years 3 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...