One-to-one disjoint path covers on alternating group graphs (Q476856): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.tcs.2014.09.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999526736 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60402187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant cycle-embedding in alternating group graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers of hypercubes with faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient unicast in bijective connection networks with the restricted faulty node set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of interconnection networks based on the alternating group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spanning connectivity of folded hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new topological properties of the triangular pyramid networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant embedding of paths in crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerance of edge pancyclicity in alternating group graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal broadcasting for locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of twisted hypercube-like networks with more faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding meshes/tori in faulty crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault diagnosability of arrangement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional diagnosability of alternating group networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Evaluation of BC Networks / rank
 
Normal rank

Latest revision as of 08:52, 9 July 2024

scientific article
Language Label Description Also known as
English
One-to-one disjoint path covers on alternating group graphs
scientific article

    Statements

    One-to-one disjoint path covers on alternating group graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    alternating group graph
    0 references
    one-to-one disjoint path covers
    0 references
    interconnection network
    0 references
    parallel computing
    0 references

    Identifiers