Forwarding indices and bisection width of Sierpiński graphs

MaRDI QIDQ5740936zbMATH OpenFDO

Authors K. S. Savitha, A. Vijayakumar

Publication date 20 July 2016

zbMATH Keywords

minimax problembisection widthSierpinski graphsedge forwarding indexvertex forwarding index

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)

Recommendations

• The forwarding indices of graphs -- a survey
• The forwarding index of directed networks
• The forwarding diameter of graphs
• On forwarding indices of networks
• scientific article; zbMATH DE number 1034100

Cited in

(1)

• A survey and classification of Sierpiński-type graphs

This page was built for publication: Forwarding indices and bisection width of Sierpiński graphs

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