Distance formula and shortest paths for the \((n,k)\)-star graphs
type: Item
instance of: scholarly article
title: Distance formula and shortest paths for the \((n,k)\)-star graphs
zbMATH Open document ID: 1203.05042
author: Eddie Cheng
author: Jerrold W. Grossman
author: L. Lipták
author: Ke Qiu
author: Zhizhang Shen
published in: Information Sciences
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5720196
zbMATH Keywords: distance formula
zbMATH Keywords: shortest paths
zbMATH Keywords: (\(n,k\))-star graphs
zbMATH Keywords: path enumeration
MaRDI profile type: Publication
full work available at URL: j.ins.2010.01.016
OpenAlex ID: W2073003370
cites work: Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
cites work: The \((n,k)\)-star graph: A generalized star graph
cites work: TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
cites work: Q3267408
cites work: Maximally connected digraphs
cites work: Higher dimensional hexagonal networks
cites work: Some topological properties of star graphs: The surface area and volume
cites work: Robustness of star graph network under link failure
cites work: Hyper Hamiltonian laceability on edge fault star graph
cites work: Constructing vertex-disjoint paths in \((n, k)\)-star graphs
cites work: Diameter, short paths and superconnectivity in digraphs
cites work: Whitney numbers of the second kind for the star poset
cites work: There is no optimal routing policy for the torus.
cites work: On the surface area of the \((n,k)\)-star graph
cites work: Substar reliability analysis in star networks
DOI: 10.1016/J.INS.2010.01.016
description: scientific article; zbMATH DE number 5720196