Results 71 to 80 of about 313,722 (173)

On prime inductive classes of graphs

European Journal of Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Quasirecognition by prime graph of finite simple groups ${}^2D_n(3)$ [PDF]

International Journal of Group Theory, 2014
Let $G$ be a finite group. In [Ghasemabadi et al., characterizations of the simple group ${}^2D_n(3)$ by prime graph and spectrum, Monatsh Math., 2011] it is proved that if $n$ is odd, then ${}^2D _n(3)$ is recognizable by prime graph and also by ...
Behrooz Khosravi , Hossein Moradi
doaj  

Even-Odd Prime Harmonious Graphs [PDF]

Pandian Journal of Mathematical Sciences, 2022
The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method.
Dr R. S. Ramkumar
doaj  

SOME CHEMICAL TOPOLOGICAL INDICES FOR THE COPRIME GRAPH OF THE INTEGERS MODULO GROUP

Barekeng
This paper delves into the exploration of the coprime graph of a finite group G, a graph with vertices representing all group elements. Vertices x and y are considered adjacent in ΓG if their orders are relatively prime.
Gustina Elfiyanti, Mutia Nofita Sari, I Gede Adhitya Wisnu Wardhana, Ade Candra, Ghazali Semil Ismail   +4 more
doaj   +1 more source

On some aspects of the generalized Petersen graph

Electronic Journal of Graph Theory and Applications, 2017
Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup \{u_i^\prime : i \in Z_p\}$ and $E(GP(p, k)) = \{u_i ...
V. Yegnanarayanan
doaj   +1 more source

THE TRIPLE IDENTITY GRAPH OF THE RING Z_n

Barekeng
Let  be a commutative ring with identity and  is an identity element of . The triple identity graph of the ring , represented by ), is an undirected simple graph with the vertex set .
Vika Yugi Kurniawan, Chessa Fanny Ekasiwi, Santoso Budi Wiyono   +2 more
doaj   +1 more source

A characterization of the prime graphs of solvable groups

Journal of Algebra, 2015
20 pages, 5 ...
Gruber, Alexander, Keller, Thomas Michael, Lewis, Mark L., Naughton, Keeley, Strasser, Benjamin   +4 more
openaire   +3 more sources

Prime Cordial Graphs

, 2017
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that if each edge is assigned the label when gcd and otherwise, then the difference between the number of edges labeled with and the number of edges labeled with is at most . A graph which admits prime cordial labeling is called a prime cordial graph. In
M. Bhuvaneshwari, Selvam Avadayappan, S. Gowsalya   +2 more
openaire   +1 more source

Cubic semisymmetric graphs of order $ 40p $ [PDF]

ریاضی و جامعه
A simple graph $\Gamma$ is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. A simple graph $\Gamma$ is called cubic whenever it is $ 3 $-regular.
Mohammad Reza Salarian, Javanshir Rezaei   +1 more
doaj   +1 more source

Symmetric Bipartite Graphs of Prime Valency

European Journal of Combinatorics, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source