Constructing goal-minimally \(k\)-diametric graphs by lifts

DOI10.1016/j.disc.2012.08.010zbMath1254.05053OpenAlexW2001534896MaRDI QIDQ1759397

Štefan Gyürki

Publication date: 20 November 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.08.010

zbMATH Keywords

diameterliftsgoal minimal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items

An efficient algorithm for testing goal-minimality of graphs

Cites Work

• On diameter 2-critical graphs
• On diameter critical graphs
• A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
• Finite geometry and character theory
• Voltage graphs, group presentations and cages
• Moore graphs and beyond: a survey of the degree/diameter problem
• Goal-minimally k-elongated graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing goal-minimally \(k\)-diametric graphs by lifts