On strong Rabin numbers of graphs and digraphs

MaRDI QIDQ3392500zbMATH OpenFDO

Authors Toru Kojima

Publication date 17 August 2009

Full work available at URL http://pphmj.com/abstract/4033.htm

zbMATH Keywords

fault diameterwide diameterRabin numberstrong Rabin number

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• On the Rabin number problem
• Strong Rabin numbers of folded hypercubes
• The bound of Rabin number for connected undirected graph
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• Generalized diameters and Rabin numbers of networks

Cited in

(6)

• scientific article; zbMATH DE number 1437257 (Why is no real title available?)
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• The bound of Rabin number for connected undirected graph
• On \(k\)-strong and \(k\)-cyclic digraphs
• Strong Rabin numbers of folded hypercubes
• On strong digraphs with a prescribed ultracenter

This page was built for publication: On strong Rabin numbers of graphs and digraphs

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