Graphs of diameter 2 with cyclic defect
S. Fajtlowicz (1987)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “On graphs with cyclic defect or excess.”
Graphs of diameter 2 with cyclic defect
Correction: “The smallest graph whose group is cyclic”
Frank Harary, Edgar M. Palmer (1972)
Czechoslovak Mathematical Journal
Similarity:
The smallest graph whose group is cyclic
Frank Harary, Edgar M. Palmer (1966)
Czechoslovak Mathematical Journal
Similarity:
Nonexistence of graphs with cyclic defect.
Miller, Mirka (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Integral quartic Cayley graphs on Abelian groups.
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic
Yi Wang, Yi-Zheng Fan, Xiao-Xin Li, Fei-Fei Zhang (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and...
On Graph-Based Cryptography and Symbolic Computations
V. A., Ustimenko (2007)
Serdica Journal of Computing
Similarity:
We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed...