On F-polynomials of thistles (Q579282): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a general class of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to matching polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Polynomials Associated with the Stars of a Graph and its Application to Node-Disjoint Decompositions of Complete Graphs and Complete Bipartite Graphs into Stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3863908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of polynomials associated with the cliques in a graph and its applications / rank
 
Normal rank

Latest revision as of 10:05, 18 June 2024

scientific article
Language Label Description Also known as
English
On F-polynomials of thistles
scientific article

    Statements

    On F-polynomials of thistles (English)
    0 references
    0 references
    1987
    0 references
    A general formula is derived for the F-polynomial of thistles - a family of graphs obtained by attaching twigs (hinged edges) to all the nodes of a basic member. The formula involves a function which is identified explicitly for certain types of F-polynomials. The function is then used to partially characterize a special family of thistles.
    0 references
    F-polynomial
    0 references
    thistles
    0 references

    Identifiers