Extremal graphs for the number of independent sets on polygonal ...
ijcopi.org › ojs › article › view
Jun 12, 2024 · We determine extremal graphs with respect to the number of independent sets for polygonal chains joined by cutting edges.
Jun 1, 2024 · In this section, we will determine the extremal graphs regarding the Merrifield- Simmons index of a polygonal chain Hn where each pair of ...
We determine extremal graphs with respect to the number of independent sets for polygonal chains joined by cutting edges. We show that for any class of ...
We determine extremal graphs with respect to the number of independent sets for polygonal chains joined by cutting edges. We show that for any class of ...
Extremal graphs for the number of independent sets on polygonal chains joined by cutting edges. Extremal graphs for the number of independent sets on ...
We determine extremal graphs with respect to the number of independent sets for polygonal chains joined by cutting edges. We show that for any class of ...
Merrifield and Simmons showed the correlation between the number of independent sets and the boiling points on polygonal chain graphs that represent chemical ...
Jan 5, 2023 · The 3n-vertex graph with the largest number of maximum independent sets is a dis- joint collection of triangles which admits 3n independent sets ...
Missing: polygonal cutting
Nov 15, 2023 · In this paper, we applied the concept of bivariate generating function to establish the recurrence relations of the numbers of maximal independent sets of ...
Missing: polygonal | Show results with:polygonal
