Results 261 to 270 of about 912,801 (279)

On Prime Distance Labeling of Graphs

2017
A graph G is a prime distance graph if its vertices can be labeled with distinct integers in such a way that for any two adjacent vertices, the absolute difference of their labels is a prime number. It is known that cycles and bipartite graphs are prime distance graphs. In this paper we derive certain general results concerning prime distance labeling.
A. Parthiban, N. Gnanamalar David
openaire   +1 more source

On Factorable Extensions and Subgraphs of Prime Graphs

SIAM Journal on Discrete Mathematics, 1989
Cartesian-factorable extensions and subgraphs of prime graphs are investigated. It is shown that minimal factorable extensions and maximal factorable subgraphs are not unique and that finding them is NP-hard even, in the case of minimal factorable extensions, if the prime graph in question is required to be a tree.
Joan Feigenbaum, Ramsey W. Haddad
openaire   +2 more sources

Degree prime graph

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
openaire   +1 more source

Vertex‐transitive graphs: Symmetric graphs of prime valency

Journal of Graph Theory, 1984
AbstractLet G be a group acting symmetrically on a graph Σ, let G1 be a subgroup of G minimal among those that act symmetrically on Σ, and let G2 be a subgroup of G1 maximal among those normal subgroups of G1 which contain no member except 1 which fixes a vertex of Σ. The most precise result of this paper is that if Σ has prime valency p, then either Σ
openaire   +2 more sources

Prime Testing for the Split Decomposition of a Graph

SIAM Journal on Discrete Mathematics, 1989
This paper develops an $O(n^2 )$ algorithm for testing whether a graph is decomposable with respect to the split decomposition. The fastest previous algorithm required $w (n^3 )$ time for this problem. This leads to an $O(n^2 )$ expected time algorithm for computing the split decomposition of a graph.
openaire   +3 more sources

Prime Graphs of Some Graphs

Journal of Advanced Research in Dynamical and Control Systems, 2020
Simaringa M, Santhoshkumar K
openaire   +1 more source

Some New Results on Prime Graphs

Open Journal of Discrete Mathematics, 2012
Samir Vaidya
exaly  

Prime Cordial Labeling of Some Graphs

Open Journal of Discrete Mathematics, 2012
Samir Vaidya
exaly  

Cocliques of Maximal Size in the Prime Graph of a Finite Simple Group

Algebra and Logic, 2011
Evgeny Vdovin, Andrey Vasilyev
exaly  

Recognition of Finite Groups by the Prime Graph

Algebra and Logic, 2006
Andrei Vitalievich Zavarnitsine
exaly