Minimum diameter and tF(f, q)

DOI10.1080/09720529.2020.1861778zbMath1485.05045OpenAlexW3145640460MaRDI QIDQ5035805

Suaad Abdulrazzaq Swadi, Samaher Abdul-Ghani

Publication date: 22 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1861778

zbMATH Keywords

addition and deletion problemslength of longest path

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Distance in graphs (05C12)

Cites Work

• Diameter vulnerability of graphs by edge deletion
• Diameter increase caused by edge deletion
• Some exact values for p(t, d)
• Diameter bounds for altered graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum diameter and t_F(f, q)