The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four

The Merrifield–Simmons index iG of a graph G is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, i.e., the number of independent vertex sets of G. In this paper, we determine the minimum Merrifield–Simmons index of unicyclic graphs with n vertices and di...

Full description

Saved in:
Bibliographic Details
Main Authors: Kun Zhao, Shangzhao Li, Shaojun Dai
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2021/6680242
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832560097030569984
author Kun Zhao
Shangzhao Li
Shaojun Dai
author_facet Kun Zhao
Shangzhao Li
Shaojun Dai
author_sort Kun Zhao
collection DOAJ
description The Merrifield–Simmons index iG of a graph G is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, i.e., the number of independent vertex sets of G. In this paper, we determine the minimum Merrifield–Simmons index of unicyclic graphs with n vertices and diameter at most four.
format Article
id doaj-art-309b3ce0514c44d48cfad52d54c6f597
institution Kabale University
issn 2314-4629
2314-4785
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series Journal of Mathematics
spelling doaj-art-309b3ce0514c44d48cfad52d54c6f5972025-02-03T01:28:26ZengWileyJournal of Mathematics2314-46292314-47852021-01-01202110.1155/2021/66802426680242The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most FourKun Zhao0Shangzhao Li1Shaojun Dai2Department of Mathematics, Jiamusi University, Jiamusi, Heilongjiang 154007, ChinaSchool of Mathematics and Statistics, Changshu Institute of Technology, Changshu, Jiangsu 215500, ChinaSchool of Mathematical Sciences, Tiangong University, Tianjin 300387, ChinaThe Merrifield–Simmons index iG of a graph G is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, i.e., the number of independent vertex sets of G. In this paper, we determine the minimum Merrifield–Simmons index of unicyclic graphs with n vertices and diameter at most four.http://dx.doi.org/10.1155/2021/6680242
spellingShingle Kun Zhao
Shangzhao Li
Shaojun Dai
The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four
Journal of Mathematics
title The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four
title_full The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four
title_fullStr The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four
title_full_unstemmed The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four
title_short The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four
title_sort minimum merrifield simmons index of unicyclic graphs with diameter at most four
url http://dx.doi.org/10.1155/2021/6680242
work_keys_str_mv AT kunzhao theminimummerrifieldsimmonsindexofunicyclicgraphswithdiameteratmostfour
AT shangzhaoli theminimummerrifieldsimmonsindexofunicyclicgraphswithdiameteratmostfour
AT shaojundai theminimummerrifieldsimmonsindexofunicyclicgraphswithdiameteratmostfour
AT kunzhao minimummerrifieldsimmonsindexofunicyclicgraphswithdiameteratmostfour
AT shangzhaoli minimummerrifieldsimmonsindexofunicyclicgraphswithdiameteratmostfour
AT shaojundai minimummerrifieldsimmonsindexofunicyclicgraphswithdiameteratmostfour