Results 111 to 120 of about 2,878 (145)
Prime Labeling of Special Graph Classes Constructed from Dutch Windmill Graphs
Let G be a simple graph of order n. Prime labeling is a bijective function f:V(G)→{1,2,…,n} such that gcd(f(u),f(v))=1 for every pair of adjacent vertices u,v in G. A graph G that satisfies the definition of prime labeling is called a prime graph.
Lestari, Jayanti Anggraini Putri +1 more
core +1 more source
Consecutive Prime and Highly Total Prime Labeling in Graphs
, 2020 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
Chemical topological graph theory constitutes a subdomain within mathematical chemistry that leverages graph theory to model chemical molecules. In this context, a chemical graph serves as a graphical representation of molecular structures. Specifically,
Wardhana, I Gede Adhitya Wisnu +4 more
core +1 more source
Analysis of Software-Engineering-Processes
, 2013 The German Aerospace Center (DLR) is one of the biggest software development facilities in Germany. Its employees create complex software using various development processes.
Teichmann, Clemens, Schreiber, Andreas
core
Finite groups and the class-size prime graph revisited
We report on recent progress concerning the relationship that exists between the algebraic structure of a finite group and certain features of its class-size prime ...
Sotomayor, Víctor
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Discrete Mathematical Sciences and Cryptography, 2009
Abstract The degree prime graph DP(G) of a graph G is a graph having the same vertex set as G and two vertices are adjacent in DP(G) if and only if their degrees are unequal and relatively prime in G. In this paper, we obtain several properties of DP(G) and characterise graphs G which are isomorphic to DP(G).
M. Sattanathan, R. Kala
exaly +2 more sources
Abstract The degree prime graph DP(G) of a graph G is a graph having the same vertex set as G and two vertices are adjacent in DP(G) if and only if their degrees are unequal and relatively prime in G. In this paper, we obtain several properties of DP(G) and characterise graphs G which are isomorphic to DP(G).
M. Sattanathan, R. Kala
exaly +2 more sources
Bulletin of the Malaysian Mathematical Sciences Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Houmem Belkhechine, Cherifa Ben Salha
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Houmem Belkhechine, Cherifa Ben Salha
openaire +1 more source
Hamiltonicity in Prime Sum Graphs
Graphs and Combinatorics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
openaire +2 more sources
Mathematics Magazine, 1993
Some time ago a colleague asked me a question about the graph formed by associating a vertex with each prime, and placing an edge between each pair of primes whose difference in absolute value is a nonnegative power of 2. His question was whether the graph formed in this way is connected.
openaire +2 more sources
Some time ago a colleague asked me a question about the graph formed by associating a vertex with each prime, and placing an edge between each pair of primes whose difference in absolute value is a nonnegative power of 2. His question was whether the graph formed in this way is connected.
openaire +2 more sources