Results 91 to 100 of about 22,931 (240)
L(2, 1)-Labeling of Circulant Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj +1 more source
Genus of total graphs from rings: A survey
AKCE International Journal of Graphs and Combinatorics, 2018 Let R be a commutative ring. The total graph T Γ ( R ) of R is the undirected graph with vertex set R and two distinct vertices x and y are adjacent if x + y is a zero divisor in R . In this paper, we present a survey of results on the genus of T Γ ( R )
T. Tamizh Chelvam, T. Asir
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2016 Abstract Let R be a commutative ring with two binary operators addition (+) and multiplication (.). Then Z n is a ring of integers modulo n, where n is a positive integer. A Absorption Cayley graph denoted by Ω ( Z n ) is a graph whose vertex set is Z n , the integer modulo n and edge set E = { a b ...
null Deepa Sinha, null Deepakshi Sharma
openaire +1 more source
Meteoritics &Planetary Science, Volume 60, Issue 10, Page 2504-2523, October 2025.Abstract The lunar regolith contains a rich history of Solar System impact events and solar activity. Many future missions will land in the south polar region of the Moon, a heavily impact cratered highland terrain, similar to the Apollo 16 landing site.
Stephanie L. Halwa +3 more
wiley +1 more source
Simulations of Cayley graphs of dihedral group [PDF]
ITM Web of ConferencesLet Γ be a finite group with identity element e and let S ⊆ Γ − {e} which is inverse-closed, i.e., S = S−1 := {s−1 : s ∈ S}. An undirected Cayley graph on a group Γ with connection set S, denoted by Cay(Γ, S), is a graph with vertex set Γ and edges xy ...
Farhan Mohammad +2 more
doaj +1 more source
The eigenvalues and energy of integral circulant graphs [PDF]
Transactions on Combinatorics, 2012 A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency matrix is circulant. Let $D$ be aset of positive, proper divisors of the integer $n>1$.
Mohsen Mollahajiaghaei
doaj
Distributed and Fault-Tolerant Routing for Borel Cayley Graphs
International Journal of Distributed Sensor Networks, 2012 We explore the use of a pseudorandom graph family, Borel Cayley graph family, as the network topology with thousands of nodes operating in a packet switching environment.
Junghun Ryu, Eric Noel, K. Wendy Tang
doaj +1 more source
The Planar Cubic Cayley Graphs [PDF]
Memoirs of the American Mathematical
Society, 2017 We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to conjectures of Mohar, Bonnington and Watkins.
openaire +2 more sources
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 In this paper, we introduce a geodesic metric space called generalized Cayley graph (gCay(P,S)) on a finitely generated polygroup. We define a hyperaction of polygroup on gCayley graph and give some properties of this hyperaction.
Arabpur F. +3 more
doaj +1 more source
Cayley graphs of order kp are hamiltonian for k < 48
, 2018 We provide a computer-assisted proof that if G is any finite group of order kp, where k < 48 and p is prime, then every connected Cayley graph on G is hamiltonian (unless kp = 2).
Morris, Dave Witte, Wilk, Kirsten
core