Certain Results on Prime and Prime Distance Labeling of Graphs
A. Parthiban,Ajaz Ahmad Pir,A. Felix +2 more
- Vol. 1531, Iss: 1, pp 012062
About:
The article was published on 2020-05-01 and is currently open access. It has received 1 citations till now. The article focuses on the topics: Prime (order theory).read more
Citations
More filters
Book ChapterDOI
Studying the Applications of Graph Labeling in Satellite Communication Through 2-Odd Labeling of Graphs
TL;DR: In this article , the authors studied the applications of graph theory in communication networks through the concept of 2-odd labeling in graphs, which assigns distinct integers to the nodes of a graph such that the positive difference of adjacent nodes is either 2 or an odd integer.
References
More filters
Journal ArticleDOI
Colouring prime distance graphs
TL;DR: It is proved that ifD contains {2, 3} and also contains a pair of twin primes (one of which may be 3), then four colours are necessary, and numerous results regarding periodic colourings are obtained.
Journal ArticleDOI
Finite prime distance graphs and 2-odd graphs
TL;DR: 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.
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 Article
About one method for estimating the roots of transcendental equations
TL;DR: In this article, the authors considered transcendental equations with trigonometric and hyperbolic functions and obtained two-sided estimates for all their roots, including the root of all the roots.