The number of shortest paths in the (n, k)-star graph (Q2931914): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group-theoretic model for symmetric interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance formula and shortest paths for the \((n,k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of shortest paths in the arrangement graph / 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: Arrangement graphs: A class of generalized star graphs / 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: Factoring \(n\)-cycles and counting maps of given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of factorizations of a full cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal factorizations of permutations into star transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transposition networks as a class of fault-tolerant robust networks / 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: Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees / 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: On the number of reduced decompositions of elements of Coxeter groups / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830914500517 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104626533 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:13, 30 July 2024

scientific article
Language Label Description Also known as
English
The number of shortest paths in the (n, k)-star graph
scientific article

    Statements

    The number of shortest paths in the (n, k)-star graph (English)
    0 references
    0 references
    0 references
    0 references
    28 November 2014
    0 references
    shortest path enumeration
    0 references
    minimum factorization of a permutation
    0 references
    \((n, k)\)-star graph
    0 references
    parallel computing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references