The number of independent sets of tricyclic graphs
From MaRDI portal
(Redirected from Publication:452922)
Cites work
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 3745213 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 5251556 (Why is no real title available?)
- scientific article; zbMATH DE number 5259335 (Why is no real title available?)
- The extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index
- The Merrifield-Simmons index in (n,n+ 1)-graphs
- The smallest Merrifield-Simmons index of (n,n+1)-graphs
- Tricyclic graphs with maximum Merrifield-Simmons index
Cited in
(8)- On the Merrifield-Simmons index of tricyclic graphs
- Orderings of a class of trees with respect to the Merrifield-Simmons index and the Hosoya index
- Counting independent sets in tricyclic graphs
- scientific article; zbMATH DE number 3941587 (Why is no real title available?)
- scientific article; zbMATH DE number 6260097 (Why is no real title available?)
- On the number of independent sets in cycle-separated tricyclic graphs
- On unimodular graphs with a unique perfect matching
- Maximizing adjacency determinant over k-cyclic graphs with a unique perfect matching: a complete characterization
This page was built for publication: The number of independent sets of tricyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452922)