Hamiltonicity of a coprime graph

DOI10.1007/s00373-021-02362-1zbMath1479.05312arXiv2005.06308OpenAlexW3182414143MaRDI QIDQ2053700

M. H. Bani Mostafa A., Ebrahim Ghorbani

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.06308

zbMATH Keywords

coprime graphprime labeling2-regular graph

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Correction to: ``Every cubic bipartite graph has a prime labeling except \(K_{3,3}\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primality of trees
• Prime labeling of graphs
• Complete tripartite subgraph in the coprime graphs of integers
• On cycles in the coprime graph of integers
• A dynamic survey of graph labeling
• Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)
• A Survey of Problems in Combinatorial Number Theory
• On extremal sets without coprimes
• Maximal sets of numbers not containing k+1 pairwise coprime integers
• Sets of integers and quasi-integers with pairwise common divisor

This page was built for publication: Hamiltonicity of a coprime graph