Results 71 to 80 of about 1,461 (103)
Orientable ℤN-Distance Magic Graphs
Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v.
Cichacz Sylwia +2 more
doaj +1 more source
On Order Prime Divisor Graphs of Finite Groups
The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K. +2 more
doaj +1 more source
Classifying cubic symmetric graphs of order 88p and 88p 2
For a simple graph Γ\Gamma , Γ\Gamma is said to be ss-regular, provided that the automorphism group of Γ\Gamma regularly acts on the set consisting of ss-arcs of Γ\Gamma .
Zhai Liangliang
doaj +1 more source
Chromatic Properties of the Pancake Graphs
Chromatic properties of the Pancake graphs Pn, n ⩾ 2, that are Cayley graphs on the symmetric group Symn generated by prefix-reversals are investigated in the paper.
Konstantinova Elena
doaj +1 more source
Extended Annihilating-Ideal Graph of a Commutative Ring
Let R be a commutative ring with identity. An ideal I of a ring R is called an annihilating-ideal if there exists a nonzero ideal J of R such that IJ = (0) and we use the notation 𝔸(R) for the set of all annihilating-ideals of R.
Nithya S., Elavarasi G.
doaj +1 more source
On finite groups all of whose cubic Cayley graphs are integral [PDF]
For any positive integer $k$, let $\mathcal{G}_k$ denote the set of finite groups $G$ such that all Cayley graphs ${\rm Cay}(G,S)$ are integral whenever $|S|\le k$. Est${\rm \acute{e}}$lyi and Kov${\rm \acute{a}}$cs \cite{EK14} classified $\mathcal{G}_k$
Ma, Xuanlong, Wang, Kaishun
core
In this paper, we introduce a new family of circulants GA(t, k), called Generalized Andrásfai graphs, where t, k ≥ 2 are integers. We study various parameters like diameter, girth, domination number etc. of GA(t, k).
Biswas Sucharita +2 more
doaj +1 more source
Perfect codes in power graphs of finite groups
The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the ...
Ma Xuanlong +4 more
doaj +1 more source
The non-commuting graph of a non-central hypergroup
The aim of this paper is to construct and study the properties of a certain graph associated with a non-central hypergroup, i.e. a hypergroup having non-commutative the associated fundamental group.
Iranmanesh Mahdiyeh +2 more
doaj +1 more source
Small clique number graphs with three trivial critical ideals
The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors ...
Alfaro Carlos A., Valencia Carlos E.
doaj +1 more source

