Wide-diameter and minimum length of fan

DOI10.1016/S0304-3975(99)00197-8MaRDI QIDQ1978711zbMATH OpenOpenAlexWikidataFDO

Authors Toru Kojima, Kiyoshi Ando

Publication date 4 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00197-8

zbMATH Keywords

fangraphlengthwide-diameterwide-distance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.
• Edge-wide-diameter of graphs with diameter d
• On the minimum 2-wide diameter of cycles with chords
• Wide diameter and diameter of networks.
• On generalized wide diameter of graphs.

Cites work

• Efficient dispersal of information for security, load balancing, and fault tolerance
• scientific article; zbMATH DE number 524123 (Why is no real title available?)

Cited in

(7)

• An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement
• Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.
• Disjoint paths and k-wide diameter of circulants with degree 4
• On the spanningw-wide diameter of the star graph
• On the minimum 2-wide diameter of cycles with chords
• scientific article; zbMATH DE number 1960655 (Why is no real title available?)
• Smooth fans that are endpoint rigid

This page was built for publication: Wide-diameter and minimum length of fan

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