The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164058326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bridged graphs and cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal domination polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological directions in cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unimodality of independence polynomials of very well-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of the Reliability Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of the node reliability polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of all-terminal reliability polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mean subtree order of graphs under edge addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers on intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reliability of graphs with node failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and Robbers on Graphs of Bounded Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brown-Colbourn conjecture on zeros of reliability polynomials is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound for the Cops and Robbers Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly optimal graphs in some classes of graphs with node failures / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:09, 21 August 2024

scientific article; zbMATH DE number 7775505
Language Label Description Also known as
English
The node cop‐win reliability of unicyclic and bicyclic graphs
scientific article; zbMATH DE number 7775505

    Statements

    The node cop‐win reliability of unicyclic and bicyclic graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2023
    0 references
    bicyclic graph
    0 references
    cop-win graph
    0 references
    graph polynomial
    0 references
    network reliability
    0 references
    node cop-win reliability
    0 references
    node reliability
    0 references
    unicyclic graph
    0 references
    uniformly most reliable
    0 references

    Identifiers

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