Results 61 to 70 of about 30,352 (163)
Prime Graph and Its Structures
, 2023 This was an undergraduate research paper and Dr. Ernest Croot, who is listed as one of the authors of this paper was not notified beforehand and this paper was uploaded without him knowing.
Croot, Ernest, Jin, Patrick
openaire +2 more sources
On minimal prime extensions of a four-vertex graph in a prime graph
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brandstädt, Andreas +2 more
openaire +2 more sources
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
Characterization of rings with planar, toroidal or projective planar prime ideal sum graphs
AKCE International Journal of Graphs and CombinatoricsLet R be a commutative ring with unity. The prime ideal sum graph [Formula: see text] of the ring R is the simple undirected graph whose vertex set is the set of all nonzero proper ideals of R and two distinct vertices I and J are adjacent if and only if
Praveen Mathil +3 more
doaj +1 more source
Maximum Edge-Colorings Of Graphs
Discussiones Mathematicae Graph Theory, 2016 An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav +1 more
doaj +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 +1 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
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
Prime Graphs with Almost True Twin Vertices
MathematicsA graph G consists of a possibly infinite set V(G) of vertices with a collection E(G) of unordered pairs of distinct vertices, called the set of edges of G. Such a graph is denoted by (V(G),E(G)).
Aymen Ben Amira, Moncef Bouaziz
doaj +1 more source
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