Prime labeling of graphs
From MaRDI portal
Cited in
(23)- Coprime index of a graph
- Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)
- Preservation of the classical meanness property of some graphs based on line graph operation
- Hamiltonicity of a coprime graph
- On prime labelings of Fibonacci trees
- Prime labelings of infinite graphs
- Some new results on prime cordial labeling
- Correction to: ``Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)
- On (semi-) edge-primality of graphs
- On prime labeling of some union graphs
- On cordial related labeling of isomorphic copies of paths and subdivision of star
- Prime-graceful graphs
- Total neighborhood prime labeling of some trees
- Subgraphs of coprime graphs on sets of consecutive integers
- Minimum coprime graph labelings
- Prime labelings of snake graphs
- Minimum coprime labelings for operations on graphs
- Minimum Coprime Labelings of Generalized Petersen and Prism Graphs
- Prime labeling in the context of web graphs without center
- STRONGLY ODD PRIME LABELING OF SOME PATH RELATED GRAPHS
- Graph Labelings: A Prime Area to Explore
- On k-prime graphs
- An edge labeling of graphs from Rado's partition regularity condition
This page was built for publication: Prime labeling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055449)
