On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique number

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth

For a graph G, the Merrifield-Simmons index i(G) and the Hosoya index z(G) are defined as the total number of independent sets and the total number of matchings of the graph G, respectively. In this paper, we characterize the graphs with the maximal Merrifield-Simmons index and the minimal Hosoya index, respectively, among the bicyclic graphs on n vertices with a given girth g.

متن کامل

The smallest Hosoya index of unicyclic graphs with given diameter∗

The Hosoya index of a (molecular) graph is defined as the total number of the matchings, including the empty edge set, of this graph. Let Un,d be the set of connected unicyclic (molecular) graphs of order n with diameter d. In this paper we completely characterize the graphs from Un,d minimizing the Hosoya index and determine the values of corresponding indices. Moreover, the third smallest Hos...

متن کامل

Graphs with maximal Hosoya index and minimal Merrifield-Simmons index

For a graph G, the Hosoya index and the Merrifield-Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we characterize the structure of those graphs that minimize the Merrifield-Simmons index and those that maximize the Hosoya index in two classes of simple connected graphs with n vertices: graphs with fixed m...

متن کامل

The Harmonic Index of Unicyclic Graphs with given Matching Number

The harmonic index of a graph G is defined as the sum of weights 2 d(u)+d(v) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this paper, we determine the graph with minimum harmonic index among all unicyclic graphs with a perfect matching. Moreover, the graph with minimum harmonic index among all unicyclic graphs with a given matching num...

متن کامل

On the Spectral Moment of Graphs with given Clique Number

Let Ln,t be the set of all n-vertex connected graphs with clique number t (2 ≤ t ≤ n). For nvertex connected graphs with given clique number, lexicographic ordering by spectral moments (S-order) is discussed in this paper. The first ∑⌊(n−t−1)/3⌋ i=1 (n − t − 3i) + 1 graphs with 3 ≤ t ≤ n − 4, and the last few graphs, in the Sorder, among Ln,t are characterized. In addition, all graphs in Ln,n ∪...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2010

ISSN: 0893-9659

DOI: 10.1016/j.aml.2009.11.005