Results 71 to 80 of about 39,303 (163)
SOME CHEMICAL TOPOLOGICAL INDICES FOR THE COPRIME GRAPH OF THE INTEGERS MODULO GROUP
BarekengThis 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 +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
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
THE TRIPLE IDENTITY GRAPH OF THE RING Z_n
BarekengLet 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 +2 more
doaj +1 more source
Prime Labeling of Jahangir Graphs
International Journal of Engineering & Technology, 2018 The paper investigates prime labeling of Jahangir graph Jn,m  for n ≥ 2, m ≥ 3 provided that nm is even. We discuss prime labeling of some graph operations viz. Fusion, Switching and Duplication to prove that the Fusion of two vertices v1 and vk where k is odd in a Jahangir graph Jn,m results to prime graph provided that the product nm is even ...
Anantha Lakshmi. +2 more
openaire +2 more sources
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 +1 more
doaj +1 more source
Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hellmuth, Marc +2 more
openaire +2 more sources
Almost-Ramanujan graphs and prime gaps
European Journal of Combinatorics, 2015 The method of Murty and Cioab shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus eliminates the need for computation.
openaire +3 more sources
On the relation between the non-commuting graph and the prime graph [PDF]
International Journal of Group Theory, 2012 Given a non-abelian finite group $G$, let $pi(G)$ denote the set of prime divisors of the order of $G$ and denote by $Z(G)$ the center of $G$. Thetextit{ prime graph} of $G$ is the graph with vertex set $pi(G)$ where two distinct primes $p$ and $q$ are ...
N. Ahanjideh, A. Iranmanesh
doaj