Results 61 to 70 of about 167 (114)
Symmetry properties are of vital importance for graphs. The famous Cayley graph is a good mathematical model as its high symmetry. The normality of the graph can well reflect the symmetry of the graph. In this paper, we characterize the normality of the direct product of Cayley graphs and give a sufficient and necessary condition for the direct product
Li Wang +3 more
wiley +1 more source
Automorphisms and independent number of single nonzero component graph over a vector space
In this paper, we introduce a graph structure, called the single non-zero component graph Γ(V) ${\Gamma}\left(\mathbb{V}\right)$ , on a finite dimensional vector space V $\mathbb{V}$ .
Xi Wentao +3 more
doaj +1 more source
Distinguishing Cartesian Products of Countable Graphs
The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +1 more source
A more detailed classification of symmetric cubic graphs [PDF]
A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ.
Marston Conder, Roman Nedela
core
Let SS be a semigroup. In this study, we first introduce the Green’s digraphs and Green’s graphs related to the Green’s relations L{\mathscr{L}}, R{\mathscr{R}}, and J{\mathscr{J}} of SS.
Cheng Yanliang, Shao Yong, Ma Xuanlong
doaj +1 more source
On the Genus of the Idempotent Graph of a Finite Commutative Ring
Let R be a finite commutative ring with identity. The idempotent graph of R is the simple undirected graph I(R) with vertex set, the set of all nontrivial idempotents of R and two distinct vertices x and y are adjacent if and only if xy = 0.
Belsi G. Gold, Kavitha S., Selvakumar K.
doaj +1 more source
Recognizing Circulant Graphs of Prime Order in Polynomial Time [PDF]
A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a
Mikhail E. Muzychuk, Gottfried Tinhofer
core
On 3-regular and 4-regular Cayley Graphs of Abelian Groups [PDF]
In this paper we find all 3-regular and 4-regular Cayley graphs of abelian groups. Their diameters are almost found. We also give another prove for a well-known theorem that G is 2-DCI if and only if G is 4-CI.
Wai-Chee Shiu
core
Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields
This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J. +4 more
doaj +1 more source

