Scaling of graphs with diameter constraint

DOI10.1515/DMA-2025-0010MaRDI QIDQ6939400zbMATH OpenFDO

Authors Mikhail A. Iordanski

Publication date 21 August 2025

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA-2025-0010

zbMATH Keywords

diameterdominating set with neighborhoodfat treesgluing and cloning operationstreesvertex-diameter graphs

Mathematics Subject Classification ID

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

Cites work

• Cloning operations and graph diameter
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1205986 (Why is no real title available?)

Cited in

(1)

• Dominant sets with neighborhood for trees

This page was built for publication: Scaling of graphs with diameter constraint

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