Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets

From MaRDI portal
Publication:5397243
Jump to:navigation, search

zbMATH Open1289.05355MaRDI QIDQ5397243FDOQ5397243


Authors: Jenq-Jong Lin Edit this on Wikidata


Publication date: 19 February 2014





Recommendations

  • Quasi-tree graphs with the second largest number of maximal independent sets
  • Quasi-tree graphs with the largest number of maximal independent sets.
  • Trees with the second and third largest number of maximum independent sets.
  • The largest number of maximal independent sets in quasi-unicyclic graphs
  • The number of maximal independent sets in trees and forests.


zbMATH Keywords

independent setquasi-tree graphquasi-forest graph


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)



Cited In (3)

  • Quasi-tree graphs with the largest number of maximal independent sets.
  • The largest number of maximal independent sets in quasi-unicyclic graphs
  • Quasi-tree graphs with the second largest number of maximal independent sets





This page was built for publication: Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5397243&oldid=20126295"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 01:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki