Diameter vulnerability of GC graphs

DOI10.1016/S0166-218X(02)00594-2zbMATH Open1020.05038MaRDI QIDQ1408451FDOQ1408451

Authors: D. Massart 

Publication date: 22 September 2003

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

Recommendations

• On large \((\Delta , D, D, 1)\)-graphs
• The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
• scientific article; zbMATH DE number 3908346
• The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
• Diameter vulnerability of iterated line digraphs

zbMATH Keywords

vulnerabilitycompound graphgraphs on alphabets(\(\varDelta,D,D',s\))-problemlarge graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites Work

• Line Digraph Iterations and the (d, k) Digraph Problem
• Title not available (Why is that?)
• Grands Graphes De Degré Et Diamètre Fixés
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Diameter vulnerability of graphs
• Title not available (Why is that?)
• On the linegraph of a directed-graph
• Large fault-tolerant interconnection networks
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• Graphs on alphabets as models for large interconnection networks
• Title not available (Why is that?)
• Large Graphs with Given Degree and Diameter—Part I
• Title not available (Why is that?)

Cited In (2)

• The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
• On large \((\Delta , D, D, 1)\)-graphs

This page was built for publication: Diameter vulnerability of GC graphs

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