Strong matching preclusion number of graphs (Q1694672): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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.2017.12.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2781705660 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56638368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Nordhaus-Gaddum type relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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 problems for the folded Petersen cube / 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 some interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion and conditional matching preclusion for regular interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional matching preclusion for the arrangement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3015671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion of \((n,k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3544998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the perfect matching free subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion under the conditional fault model / 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: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion for \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong matching preclusion for \(k\)-ary \(n\)-cubes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:39, 15 July 2024

scientific article
Language Label Description Also known as
English
Strong matching preclusion number of graphs
scientific article

    Statements

    Strong matching preclusion number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 February 2018
    0 references
    interconnection networks
    0 references
    perfect matching
    0 references
    strong matching preclusion number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers