Finite prime distance graphs and 2-odd graphs
Reads0
Chats0
TLDR
It is proved that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs arePrime distance graphs if and only if the Twin Prime Conjecture and dePolignac’s Conjectures are true, respectively.About:
This article is published in Discrete Mathematics.The article was published on 2013-10-28 and is currently open access. It has received 8 citations till now. The article focuses on the topics: Chordal graph & Indifference graph.read more
Citations
More filters
Book ChapterDOI
On Prime Distance Labeling of Graphs
A. Parthiban,N. Gnanamalar David +1 more
TL;DR: This paper derives certain general results concerning prime distance labeling of some cycle related graphs in the context of some graph operations, namely, power, fusion, duplication and vertex switching in cycle \(C_n\).
Journal ArticleDOI
On finite prime distance graphs
TL;DR: In this paper, it was shown that a graph G is a prime distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is a Prime number.
Journal ArticleDOI
Prime power and prime product distance graphs
TL;DR: In this article, it was shown that a graph G is a k-prime product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the product of at most k primes.
Proceedings ArticleDOI
Prime labeling and prime distance labeling of some classes of graphs
Ram Dayal,A. Parthiban +1 more
References
More filters
Book
Introduction to Graph Theory
TL;DR: In this article, the authors introduce the concept of graph coloring and propose a graph coloring algorithm based on the Eulers formula for k-chromatic graphs, which can be seen as a special case of the graph coloring problem.
Journal Article
A Dynamic Survey of Graph Labeling
TL;DR: In this survey I have collected everything I could find on graph labelings techniques that have appeared in journals that are not widely available.
Book
History of the Theory of Numbers
Abstract: THE third and concluding volume of Prof. Dickson's great work deals first with the arithmetical. theory of binary quadratic forms. A long chapter on the class-number is contributed by Mr. G. H. Cresse. Next comes an account of existing knowledge on quadratic forms in three or more variables, followed by chapters on cubic forms, Hermitian and bilinear forms, and modular invariants and covariants.History of the Theory of Numbers.Prof. Leonard Eugene Dickson. Vol. 3: Quadratic and Higher Forms. With a Chapter on the Class Number by G. H. Cresse. (Publication No. 256.) Pp. v + 313. (Washington: Carnegie Institution, 1923.) 3.25 dollars.
Book
Graph Theory and Its Applications
Jonathan L. Gross,Jay Yellen +1 more
TL;DR: In this article, the authors present a model for drawing graphs and digraphs based on the topology of low dimensions Higher-Order Surfaces and a model of a graph.
Book
Elementary Number Theory
TL;DR: In this paper, the authors present a theory of divisibility theory in the Integers, which is based on the Fermat Conjecture of the Quadratic Reciprocity Law.