scientific article; zbMATH DE number 3882467

MaRDI QIDQ3216683zbMATH OpenFDO

Authors Ivan Gutman

Publication date 1983

Full work available at URL https://eudml.org/doc/117177

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

i-maximal graphsi-minimal graphsk-th independence number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graphs with given k-independence number
• Maximal k-independent sets in graphs
• On the coefficients of the independence polynomial of graphs
• Independence polynomials of \(k\)-tree related graphs
• Integers for the number of maximal independent sets in graphs

Cited in

(11)

• Independence polynomials of circulants with an application to music
• Graphs with unique maximum independent sets
• Semi-regular graphs of minimum independence number
• Optimal graphs for independence and \(k\)-independence polynomials
• Admissible property of graphs in terms of independence number
• Independence saturation number of some classes of graphs
• GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS
• Min-max and max-min graph saturation parameters
• On the location of roots of independence polynomials
• Independence numbers of polyhedral graphs
• Independence polynomials of \(k\)-tree related graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216683)