Displaying similar documents to “Moore graphs and beyond: a survey of the degree/diameter problem.”

Graphs of low chordality.

Chandran, L.Sunil, Lozin, Vadim V., Subramanian, C.R. (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Extremum degree sets of irregular oriented graphs and pseudodigraphs

Zyta Dziechcińska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzisław Skupień (2006)

Discussiones Mathematicae Graph Theory

Similarity:

A digraph in which any two vertices have distinct degree pairs is called irregular. Sets of degree pairs for all irregular oriented graphs (also loopless digraphs and pseudodigraphs) with minimum and maximum size are determined. Moreover, a method of constructing corresponding irregular realizations of those sets is given.