Tree counting polynomials for labelled graphs. I: Properties (Q1160141): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0016-0032(81)90053-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987546852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5846347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonisomorphic trees with the same T-polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characteristic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stirling number identities from chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\sigma\)-polynomials and graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of graphs by their number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations of a graph increasing its Laplacian polynomial and number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient relationship between rook and chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating formulas for the number of trees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Wang Algebra of Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Determinant of the Adjacency Matrix of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a general class of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869292 / rank
 
Normal rank

Latest revision as of 13:47, 13 June 2024

scientific article
Language Label Description Also known as
English
Tree counting polynomials for labelled graphs. I: Properties
scientific article

    Statements

    Tree counting polynomials for labelled graphs. I: Properties (English)
    0 references
    1981
    0 references
    characteristic polynomials
    0 references
    polynomial representations for connected graphs
    0 references
    labelled graphs
    0 references

    Identifiers

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