Graphs of diameter 2 with cyclic defect
S. Fajtlowicz (1987)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Correction: “The smallest graph whose group is cyclic””
Graphs of diameter 2 with cyclic defect
On graphs with cyclic defect or excess.
Delorme, Charles, Pineda-Villavicencio, Guillermo (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The smallest graph whose group is cyclic
Frank Harary, Edgar M. Palmer (1966)
Czechoslovak Mathematical Journal
Similarity:
Cyclic operads and homology of graph complexes
Markl, Martin
Similarity:
Some news about oblique graphs
Andrey A. Dobrynin, Leonid S. Melnikov, Jens Schreyer, Hansjoachim Walther (2002)
Discussiones Mathematicae Graph Theory
Similarity:
A k-gon α of a polyhedral graph G(V,E,F) is of type ⟨b₁,b₂,...,bₖ⟩ if the vertices incident with α in cyclic order have degrees b₁,b₂,...,bₖ and ⟨b₁,b₂,...,bₖ⟩ is the lexicographic minimum of all such sequences available for α. A polyhedral graph G is oblique if it has no two faces of the same type. Among others it is shown that an oblique graph contains vertices of degree 3.