Pages that link to "Item:Q3893958"
From MaRDI portal
The following pages link to Enumeration of structure-sensitive graphical subsets: Theory (Q3893958):
Displayed 17 items.
- The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain (Q306101) (← links)
- Enumerating independent vertex sets in grid graphs (Q501235) (← links)
- Cacti with the maximum Merrifield-Simmons index and given number of cut edges (Q602824) (← links)
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index (Q607700) (← links)
- Unicycle graphs with extremal Merrifield-Simmons index (Q926924) (← links)
- The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices (Q937620) (← links)
- A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025) (← links)
- Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices (Q1654390) (← links)
- Domino tilings of the expanded Aztec diamond (Q1699576) (← links)
- State matrix recursion method and monomer-dimer problem (Q1732778) (← links)
- Domino tilings for augmented Aztec rectangles and their chains (Q2001980) (← links)
- Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains (Q2089260) (← links)
- An algorithm for calculating the independence and vertex-cover polynomials of a graph (Q2383889) (← links)
- Maximal independent sets on a grid graph (Q2404364) (← links)
- Domino tilings of Aztec octagons (Q2701403) (← links)
- Augmented Aztec bipyramid and dicube tilings (Q6056467) (← links)
- Counting maximal independent sets in some \(n\)-gonal cacti (Q6064859) (← links)