Some properties of locally homogeneous graphs.
Al-Addasi, Salah (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Al-Addasi, Salah (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
Ľubomír Šoltés (1990)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Roman Nedela (1992)
Czechoslovak Mathematical Journal
Similarity:
Benoit Larose (2002)
Discussiones Mathematicae Graph Theory
Similarity:
We give several characterisations of strongly projective graphs which generalise in many respects odd cycles and complete graphs [7]. We prove that all known families of projective graphs contain only strongly projective graphs, including complete graphs, odd cycles, Kneser graphs and non-bipartite distance-transitive graphs of diameter d ≥ 3.
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Vladislav Bína, Jiří Přibil (2015)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The paper brings explicit formula for enumeration of vertex-labeled split graphs with given number of vertices. The authors derive this formula combinatorially using an auxiliary assertion concerning number of split graphs with given clique number. In conclusion authors discuss enumeration of vertex-labeled bipartite graphs, i.e., a graphical class defined in a similar manner to the class of split graphs.