Distance formula and shortest paths for the (n,k)-star graphs

DOI10.1016/J.INS.2010.01.016MaRDI QIDQ975861zbMATH OpenOpenAlexFDO

Authors Eddie Cheng, Jerrold W. Grossman, L. Lipták, Ke Qiu, Zhizhang Shen

Publication date 11 June 2010

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2010.01.016

zbMATH Keywords

shortest pathsdistance formula(\(n,k\))-star graphspath enumeration

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• The Number of Shortest Paths in the (n, k)-Star Graphs
• The number of shortest paths in the \((n, k)\)-star graph
• On the Surface Area of the (n, k)-Star Graph
• Distance distribution of nodes in star graphs
• On the surface area of the \((n,k)\)-star graph

Cites work

• scientific article; zbMATH DE number 3149991 (Why is no real title available?)
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Diameter, short paths and superconnectivity in digraphs
• Higher dimensional hexagonal networks
• Hyper Hamiltonian laceability on edge fault star graph
• Maximally connected digraphs
• On the surface area of the \((n,k)\)-star graph
• Robustness of star graph network under link failure
• Some topological properties of star graphs: The surface area and volume
• Substar reliability analysis in star networks
• The (n,k)-star graph: A generalized star graph
• There is no optimal routing policy for the torus.
• Topological properties of the \((n,k)\)-star graph
• Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
• Whitney numbers of the second kind for the star poset

Cited in

(11)

• Application of width distance on semi-star link satellite constellation
• On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
• Fault-tolerance of (n, k)-star networks
• Maximum independent sets partition of \((n, k)\)-star graphs
• The Number of Shortest Paths in the (n, k)-Star Graphs
• Efficiency of star-like graphs and the Atlanta subway network
• Star graphs: threaded distance trees and E-sets
• The number of shortest paths in the arrangement graph
• The panpositionable panconnectedness of augmented cubes
• The number of shortest paths in the \((n, k)\)-star graph
• Conditional fault-tolerant routing of \((n,k)\)-star graphs

This page was built for publication: Distance formula and shortest paths for the \((n,k)\)-star graphs

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