Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On finite prime distance graphs

From MaRDI portal
Publication:2241660
Jump to:navigation, search

DOI10.1007/S13226-021-00135-3zbMATH Open1477.05165OpenAlexW3175711623MaRDI QIDQ2241660

G. Samdanielthompson, A. Parthiban, K. Sathish Kumar

Publication date: 9 November 2021

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-021-00135-3



zbMATH Keywords

distance graphsprime distance graphsfinite prime distance graphsprime distance labeling


Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)


Cites Work

  • Finite prime distance graphs and 2-odd graphs
  • Colouring the real line
  • Colouring prime distance graphs


Related Items (4)

Finite primitive distance-transitive graphs ⋮ Finite prime distance graphs and 2-odd graphs ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ Imprimitive distance-transitive graphs with primitive core of diameter at least 3






This page was built for publication: On finite prime distance graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2241660&oldid=14787057"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 07:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki