Distance formula and shortest paths for the \((n,k)\)-star graphs (Q975861): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2010.01.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073003370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((n,k)\)-star graph: A generalized star graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher dimensional hexagonal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some topological properties of star graphs: The surface area and volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness of star graph network under link failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper Hamiltonian laceability on edge fault star graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing vertex-disjoint paths in \((n, k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter, short paths and superconnectivity in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Whitney numbers of the second kind for the star poset / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no optimal routing policy for the torus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the surface area of the \((n,k)\)-star graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substar reliability analysis in star networks / rank
 
Normal rank

Latest revision as of 22:38, 2 July 2024

scientific article
Language Label Description Also known as
English
Distance formula and shortest paths for the \((n,k)\)-star graphs
scientific article

    Statements

    Distance formula and shortest paths for the \((n,k)\)-star graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    0 references
    distance formula
    0 references
    shortest paths
    0 references
    (\(n,k\))-star graphs
    0 references
    path enumeration
    0 references
    0 references