Ratio of the number of 1-nearly independent vertex subsets and the Merrifield-Simmons index

Abstract

The number σk(G) of induced subgraphs with size k of a graph G was introduced recently as the number of k-nearly independent vertex subsets of G. Results highlighting similarity and difference in the behaviours of σ1 and σ0, have been reported. In this paper, we provide more comparison tools, by studying the ratio σ1(G)σ0(G). We establish sharp lower and upper bounds for this ratio over various classes of graphs, including connected graphs, trees, and forests.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…