On coloring the odd-distance graph.
Steinhardt, Jacob (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Steinhardt, Jacob (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Berisha, F.M., Filipović, M.H. (1997)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Fuglede, Bent (2003)
Annales Academiae Scientiarum Fennicae. Mathematica
Similarity:
Fiol, M.A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
R. Vasuki, A. Nagarajan (2012)
Kragujevac Journal of Mathematics
Similarity:
Cheng, Sui Sun, Wu, Yi Feng (2009)
Applied Mathematics E-Notes [electronic only]
Similarity:
Ante Graovac, Gani Jashari, Mate Strunje (1985)
Aplikace matematiky
Similarity:
Analytic expressions for the roots of the distance polynomial of a cycle are given.
Martinez-Morales, Jose L. (2010)
Abstract and Applied Analysis
Similarity:
d'Azevedo Breda, A.M. (1996)
Portugaliae Mathematica
Similarity:
Xiaoxia Fan, Yanfeng Luo, Xing Gao (2013)
Open Mathematics
Similarity:
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let G 0 be the graph obtained from G by deleting all pendant vertices and δ(G) the minimum degree of vertices of G. In this paper, all connected tricyclic graphs G with δ(G 0) ≥ 2 and exactly two main eigenvalues are determined.