Integral quartic Cayley graphs on Abelian groups.

Abdollahi, A.; Vatandoost, E.

Displaying similar documents to “Integral quartic Cayley graphs on Abelian groups.”

Radio Graceful Hamming Graphs

Amanda Niedzialomski (2016)

Discussiones Mathematicae Graph Theory

Similarity:

For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G). In this setting, f is injective; if f is also surjective onto {1, 2, . . . , |V (G)|}, then f is a consecutive radio labeling. Graphs that can be labeled with such a labeling are called radio graceful. In this paper, we give two results on the existence of radio...

Hyperenergetic graphs and cyclomatic number

X. Shen, Y. Hou, I. Gutman, X. Hui (2010)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

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...

All Ramsey numbers $r (K_{3}, G)$ for connected graphs of order 9.

Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Cospectral Graphs With Least Eigenvalue at Least -2

Dragoš Cvetković, Mirko Lepović (2005)

Publications de l'Institut Mathématique

Similarity:

Signless Laplacians and line graphs

D. Cvetković (2005)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

Some results on graphs with at most two positive eigenvalues.

Petrović, Miroslav (1991)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Isomorphic components of Kronecker product of bipartite graphs

Pranava K. Jha, Sandi Klavžar, Blaž Zmazek (1997)

Discussiones Mathematicae Graph Theory

Similarity:

Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.

Dominating bipartite subgraphs in graphs

Gábor Bacsó, Danuta Michalak, Zsolt Tuza (2005)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is hereditarily dominated by a class 𝓓 of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to 𝓓. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.