Triameter of graphs

DOI10.7151/dmgt.2212zbMath1458.05052arXiv1804.01088OpenAlexW2796415581MaRDI QIDQ2227115

Angsuman Das

Publication date: 10 February 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

distanceradio \(k\)-coloringNordhaus-Gaddum bounds

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (1)

A note on the triameter of graphs

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
• Antipodal number of some powers of cycles
• On characterizing radio \(k\)-coloring problem by path covering problem
• A lower bound for radio \(k\)-chromatic number
• A table of connected graphs on six vertices
• Neural ideals in SageMath
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span
• Graphic vertices of the metric polytope
• On Hadwiger's Number and the Stability Number

This page was built for publication: Triameter of graphs