Triameter of graphs

DOI10.7151/DMGT.2212MaRDI QIDQ2227115zbMATH OpenOpenAlexFDO

Authors Angsuman Das

Publication date 10 February 2021

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

distanceradio \(k\)-coloringNordhaus-Gaddum bounds

Mathematics Subject Classification ID

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

Abstract: In this paper, we introduce and study a new distance parameter {it triameter} of a connected graph $G$, which is defined as $maxd(u,v)+d(v,w)+d(u,w):u,v,winV$ and is denoted by $tr(G)$. We find various upper and lower bounds on $tr(G)$ in terms of order, girth, domination parameters etc., and characterize the graphs attaining those bounds. In the process, we provide some lower bounds of (connected, total) domination numbers of a connected graph in terms of its triameter. The lower bound on total domination number was proved earlier by Henning and Yeo. We provide a shorter proof of that. Moreover, we prove Nordhaus-Gaddum type bounds on $tr(G)$ and find $tr(G)$ for some specific family of graphs.

Recommendations

• A note on the triameter of graphs
• Triple connected complementary tree domination number of a graph
• scientific article; zbMATH DE number 434494
• Publication:4863465
• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture

Cites work

• scientific article; zbMATH DE number 3873384 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• A lower bound for radio \(k\)-chromatic number
• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
• A table of connected graphs on six vertices
• Antipodal number of some powers of cycles
• Graphic vertices of the metric polytope
• Neural ideals in SageMath
• On Hadwiger's Number and the Stability Number
• On characterizing radio \(k\)-coloring problem by path covering problem
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span

Cited in

(4)

• scientific article; zbMATH DE number 2021405 (Why is no real title available?)
• Graphs of gonality three
• scientific article; zbMATH DE number 3910412 (Why is no real title available?)
• A note on the triameter of graphs

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Triameter of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227115)