Wide-diameter and minimum length of fan

DOI10.1016/S0304-3975(99)00197-8zbMATH Open0938.68062OpenAlexW2016969173WikidataQ126844062 ScholiaQ126844062MaRDI QIDQ1978711FDOQ1978711

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

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.

zbMATH Keywords

graphlengthfanwide-diameterwide-distance

Mathematics Subject Classification ID

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

Cites Work

• Efficient dispersal of information for security, load balancing, and fault tolerance
• Title not available (Why is that?)

Cited In (7)

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

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)