Results 41 to 50 of about 782,126 (230)
A study on the number of edges of some families of graphs and generalized Mersenne numbers
The relationship between the Nandu sequence of the SM family of graphs and the Generalized Mersenne numbers is demonstrated in this study. Nandu sequences are related to the two families of SM sum graphs and SM Balancing graphs.
K.G. Sreekumar +3 more
doaj +1 more source
Finite groups whose character degree graphs coincide with their prime graphs [PDF]
Veliev, Oktay A. (Dogus Author)In the literature, there are several graphs related to a finite group G. Two of them are the character degree graph, denoted by ΔG), and the prime graph ΓG), In this paper we classify all finite groups whose character ...
Temha Erkoç +8 more
core +1 more source
Random Cyclic Triangle-Free Graphs of Prime Order
Cyclic triangle-free process (CTFP) is the cyclic analog of the triangle-free process. It begins with an empty graph of order n and generates a cyclic graph of order n by iteratively adding parameters, chosen uniformly at random, subject to the ...
Yu Jiang +3 more
doaj +1 more source
Relatively Prime Detour Domination Number of Some Switching Graphs
In this paper, we introduce the concept of relatively prime detour domination number for switching graph. If a set S ⊆ V is a detour set, a dominating set with at least two elements, and has (deg(u), deg(v)) = 1 for each pair of vertices u and v, then it
C Jayasekaran, L. G. Binoja
doaj +1 more source
On the power graphs of elementary abelian and extra special $p$-groups [PDF]
For a given odd prime $p$, we investigate the power graphs of three classes of finite groups: the elementary abelian groups of exponent $p$, and the extra special groups of exponents $p$ or $p^2$. We show that these power graphs are Eulerian for
Masoud Pourhasan, Hossein Doostie
doaj +1 more source
On minimal prime extensions of a four-vertex graph in a prime graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Brandstädt +2 more
openaire +3 more sources
Prime labelings on planar grid graphs
It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn.
Stephen James Curran
doaj +1 more source
Consecutive Prime and Highly Total Prime Labeling in Graphs [PDF]
This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total prime labeling. These are variations on prime labeling, introduced by Tout, Dabboucy, and Howalla in 1982.
Scholle, Robert
core +1 more source
Classifying Character Degree Graphs with Seven Vertices [PDF]
We study here the graphs with seven vertices in an effort to classify which of them appear as the prime character degree graphs of finite solvable groups. This classification is complete for the disconnected graphs.
Jacob Laubacher +2 more
doaj +1 more source

