Independence number and disjoint theta graphs.
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A note on the distance-balanced property of generalized Petersen graphs.”
Independence number and disjoint theta graphs.
On the graphs with maximum distance or -diameter
Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)
Mathematica Slovaca
Similarity:
Criticality concepts in geodetic graphs
Pavol Híc (1986)
Mathematica Slovaca
Similarity:
Hamiltonicity of -traceable graphs.
Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
Pablo De Caria, Terry A. McKee (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly chordal graphs
Diameter in path graphs.
Belan, A., Jurica, P. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On partially directed -graphs
Pavol Híc (1984)
Mathematica Slovaca
Similarity:
Degree powers in graphs with a forbidden even cycle.
Nikiforov, Vladimir (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity: