Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index

نویسندگان

  • Kexiang Xu
  • Kinkar Ch. Das
چکیده

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the extremal (maximal and minimal) unicyclic and bicyclic graphs with respect to Harary index. 2010 Mathematics Subject Classification: 05C90

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

ثبت نام

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

منابع مشابه

The Signless Laplacian Estrada Index of Unicyclic Graphs

‎For a simple graph $G$‎, ‎the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$‎, ‎where $q^{}_1‎, ‎q^{}_2‎, ‎dots‎, ‎q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$‎. ‎In this paper‎, ‎we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...

متن کامل

On the harmonic index of the unicyclic and bicyclic graphs

The harmonic index is one of the most important indices in chemical and mathematical fields. It’s a variant of the Randić index which is the most successful molecular descriptor in structure-property and structureactivity relationships studies. The harmonic index gives somewhat better correlations with physical and chemical properties comparing with the well known Randić index. The harmonic ind...

متن کامل

The Harmonic Index for Unicyclic and Bicyclic Graphs with given Matching Number

The harmonic index of a graph G is defined as the sum of the weights 2 d.u/Cd.v/ of all edges uv of G, where d.u/ denotes the degree of a vertex u in G. In this paper, we present the minimum harmonic indices for unicyclic and bicyclic graphs with n vertices and matching number m (2 m bn2 c), respectively. The corresponding extremal graphs are also characterized. 2000 Mathematics Subject Classif...

متن کامل

The Signless Laplacian Spectral Radius of Unicyclic and Bicyclic Graphs with a Given Girth

Let U(n, g) and B(n, g) be the set of unicyclic graphs and bicyclic graphs on n vertices with girth g, respectively. Let B1(n, g) be the subclass of B(n, g) consisting of all bicyclic graphs with two edge-disjoint cycles and B2(n, g) = B(n, g)\B1(n, g). This paper determines the unique graph with the maximal signless Laplacian spectral radius among all graphs in U(n, g) and B(n, g), respectivel...

متن کامل

Extremal Results concerning the General Sum-connectivity Index in Some Classes of Connected Graphs

This paper surveys extremal properties of general sum-connectivity index χα(G) in several classes of connected graphs of given order for some values of the parameter α: a) trees; b) connected unicyclic or bicyclic graphs; c) graphs of given connectivity. Work presented as invited lecture at CAIM 2014, September 19-22, “Vasile Alecsandri” University of Bacău, Romania.

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011