Integral quartic Cayley graphs on Abelian groups.
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wang, Jianfeng, Belardo, Francesco, Huang, Qiongxiang, Marzi, Enzo M.Li (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sander, Torsten (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Guang-Hui (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
Bojan Mohar, Svatopluk Poljak (1990)
Czechoslovak Mathematical Journal
Similarity:
Chen, Yanqing, Wang, Ligong (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dragoš Cvetković, Peter Rowlinson, Slobodan Simić (2007)
Publications de l'Institut Mathématique
Similarity:
D. Cvetković, P. Rowlinson, Z. Stanić, M. G. Yoon (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Cvetković, Dragoš, Simić, Slobodan (1993)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
G. Abay-Asmerom, R. Hammack, C.E. Larson, D.T. Taylor (2011)
Discussiones Mathematicae Graph Theory
Similarity:
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently the graphs for which equality holds have been classified. Here we investigate the members of this class that are Cartesian products. We show that for non-trivial graphs G and H, α(G ☐ H) = r(G ☐ H) if and only if one factor is a complete graph on two vertices, and the other is a nontrivial complete graph. We also prove a new (polynomial computable) lower bound α(G ☐ H) ≥ 2r(G)r(H)...