Diameter vulnerability of GC graphs
type: Item
instance of: scholarly article
title: Diameter vulnerability of GC graphs
zbMATH Open document ID: 1020.05038
DOI: 10.1016/S0166-218X(02)00594-2
author: D. Massart
published in: Discrete Applied Mathematics
publication date: 2003-09-22T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1984621
zbMATH Keywords: compound graph
zbMATH Keywords: (\(\varDelta,D,D',s\))-problem
zbMATH Keywords: graphs on alphabets
zbMATH Keywords: large graph
zbMATH Keywords: vulnerability
MaRDI profile type: Publication
cites work: On the linegraph of a directed-graph
cites work: Q3039368
cites work: Grands Graphes De Degré Et Diamètre Fixés
cites work: Large fault-tolerant interconnection networks
cites work: Q3686639
cites work: Q3834069
cites work: On a problem of a. kotzig concerning factorizations of 4‐regular graphs
cites work: Large Graphs with Given Degree and Diameter—Part I
cites work: Q5184952
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: Q4712019
cites work: Q3712354
cites work: Graphs on alphabets as models for large interconnection networks
cites work: Q5345642
cites work: Diameter vulnerability of graphs
description: scientific article; zbMATH DE number 1984621