On the problem of determining which \((n, k)\)-star graphs are Cayley graphs (Q2361079): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1007/s00373-016-1741-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2558374225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper hamiltonian laceability of Cayley graphs generated by transpositions / 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: Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the connectivity of the star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting Cayley graphs generated by transposition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of shortest paths in the (n, k)-star 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: The forwarding index of communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerant routing in the star and pancake interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-foreward index of star graphs and other Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster fault-tolerant routing in star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3884021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On forwarding indices of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the genus of star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs / 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: Q3837123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of fault tolerance in star graph / 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: On a Class of Fixed-Point-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 4-star graph is not a subgraph of any hypercube / 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: Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipancyclic properties of Cayley graphs generated by transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion-free, dilation-2 embedding of complete binary trees into star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERALIZED CONNECTIVITY OF (n, k)-STAR GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-many node-disjoint paths in \((n,k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: VLSI layouts of complete graphs and star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS / rank
 
Normal rank

Latest revision as of 00:56, 14 July 2024

scientific article
Language Label Description Also known as
English
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
scientific article

    Statements

    On the problem of determining which \((n, k)\)-star graphs are Cayley graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2017
    0 references
    interconnection networks
    0 references
    Cayley graphs
    0 references
    vertex-forwarding index
    0 references
    \((n, k)\)-star graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers