Cargando…
The expected values of the total numbers of independent edge sets and independent sets in random alpha-type pentagonal chains()
A independent edge set of G containing mutually independent edges is also called a matching of G. The total numbers of matchings and independent sets of a graph G, namely, the Hosoya index and the Merrifield-Simmons index, respectively, are two important topological indices. We compute the average t...
Autores principales: | Wei, Lina, Bian, Hong, Yu, Haizheng |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9898681/ https://www.ncbi.nlm.nih.gov/pubmed/36747532 http://dx.doi.org/10.1016/j.heliyon.2023.e13163 |
Ejemplares similares
-
The extremal pentagon-chain polymers with respect to permanental sum
por: Wu, Tingzeng, et al.
Publicado: (2020) -
Set theory: Boolean-valued models and independence proofs
por: Bell, John L
Publicado: (2005) -
Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets
por: De Ita, Guillermo, et al.
Publicado: (2020) -
Simplified independence proofs: Boolean valued models of set theory
por: Rooser, J Barkley
Publicado: (2014) -
Fair Packing of Independent Sets
por: Chiarelli, Nina, et al.
Publicado: (2020)