Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs (Q3082859): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Permanent of the Laplacian matrix of trees and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum permanents of matrices of zeros and ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: An update on Minc's survey of open problems involving permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for the signless laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the smallest eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of cospectral graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanental polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for permanents of non-negative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for permanents of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the minc-brègman upper bound for the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: New permanental upper bounds for nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanental bounds for nonnegative matrices via decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum / rank
 
Normal rank

Latest revision as of 22:03, 3 July 2024

scientific article
Language Label Description Also known as
English
Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
scientific article

    Statements

    Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs (English)
    0 references
    0 references
    0 references
    17 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    permanent
    0 references
    signless Laplacian matrix
    0 references
    unicyclic graph
    0 references
    bipartite graph
    0 references
    tree
    0 references
    girth
    0 references
    0 references