Strong matching preclusion of \((n,k)\)-star graphs (Q906391): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.051 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2264766799 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.051 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2264766799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional matching preclusion sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for some interconnection networks / 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: Q3544998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (conditional) matching preclusion for burnt pancake graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional fault hamiltonian connectivity of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional fault Hamiltonicity of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional matching preclusion for hypercube-like interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Latest revision as of 08:18, 11 July 2024

scientific article
Language Label Description Also known as
English
Strong matching preclusion of \((n,k)\)-star graphs
scientific article

    Statements

    Strong matching preclusion of \((n,k)\)-star graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2016
    0 references
    perfect matching
    0 references
    almost perfect matching
    0 references
    \((n, k)\)-star graphs
    0 references

    Identifiers