The number of spanning trees of a graph with given matching number (Q5739584): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.1080/00207160.2015.1021341 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994823003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the number of spanning trees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound for the number of spanning trees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper bounds for the number of spanning trees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the number of spanning trees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the complexity of a simple graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian graph eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning forests of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees of networks based on cycle basis representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees on the (<i>p,</i><i>p</i>+2) graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:15, 12 July 2024

scientific article; zbMATH DE number 6604243
Language Label Description Also known as
English
The number of spanning trees of a graph with given matching number
scientific article; zbMATH DE number 6604243

    Statements

    The number of spanning trees of a graph with given matching number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2016
    0 references
    graph
    0 references
    matrix
    0 references
    Laplacian spectrum
    0 references
    spanning tree
    0 references
    matching number
    0 references

    Identifiers