The number of independent sets in unicyclic graphs with a given diameter

DOI10.1016/J.DAM.2008.10.012zbMATH Open1172.05326OpenAlexW1986124287MaRDI QIDQ1028107FDOQ1028107

Zhongxun Zhu, Shuchao Li

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.012

zbMATH Keywords

diameterindependent setunicyclic graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)

Cites Work

• On cliques in graphs
• On the hardness of approximate reasoning
• The number of independent sets in unicyclic graphs
• Extremal catacondensed benzenoids
• Extremal hexagonal chains concerning largest eigenvalue
• Maximal independent sets in graphs with at most one cycle
• The number of maximum independent sets in graphs
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
• The Hosoya Index and the Merrifield–Simmons Index of Some Nanostructures
• Tricyclic graphs with maximum Merrifield-Simmons index
• The number of independent sets of unicyclic graphs with given matching number
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• Counting independent sets in tricyclic graphs
• Graphs with given number of cut vertices and extremal Merrifield-Simmons index
• On the Merrifield-Simmons index of tricyclic graphs
• Trees with given stability number and minimum number of stable sets
• Further results on the Merrifield-Simmons index

This page was built for publication: The number of independent sets in unicyclic graphs with a given diameter

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