scientific article; zbMATH DE number 528857

zbMATH Open0808.05083MaRDI QIDQ4285380FDOQ4285380

Authors: Ivan Gutman 

Publication date: 24 March 1994

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

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

compound graphsindependent vertex sets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cited In (23)

• Title not available (Why is that?)
• On the independence polynomial of the corona of graphs
• Independence polynomials of some compound graphs
• Title not available (Why is that?)
• Structure of independent sets in direct products of some vertex-transitive graphs
• A note on purely imaginary independence roots
• Independent sets in direct products of vertex-transitive graphs
• Building graphs whose independence polynomials have only real roots
• Clique cover products and unimodality of independence polynomials
• The number of independent sets in unicyclic graphs with a given diameter
• On the stability of independence polynomials
• Independent vertex sets in the Zykov sum
• Unimodality of the independence polynomials of some composite graphs
• Roots of independence polynomials of well covered graphs
• Upper bounds for the independence polynomial of graphs at \(-1\)
• Title not available (Why is that?)
• Tricyclic graphs with maximum Merrifield-Simmons index
• The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices
• Cacti with the maximum Merrifield-Simmons index and given number of cut edges
• Unimodality of independence polynomials of the incidence product of graphs
• The roller-coaster conjecture revisited
• Unimodality of independence polynomials of the cycle cover product of graphs
• A sharp upper bound for the number of stable sets in graphs with given number of cut edges

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 Q4285380)