given size of matching
Recently Published Documents

TOTAL DOCUMENTS

4
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals The largest spectral radius of uniform hypertrees with a given size of matching

2018 ◽  
Vol 68 (9) ◽  
pp. 1779-1791 ◽  
Author(s):  
Li Su ◽  
Liying Kang ◽  
Honghai Li ◽  
Erfang Shan
Keyword(s):  
Spectral Radius ◽  
Given Size Of Matching

scholarly journals On the harmonic index of bicyclic conjugated molecular graphs

Filomat ◽  
2014 ◽  
Vol 28 (2) ◽  
pp. 421-428 ◽  
Author(s):  
Yan Zhu ◽  
Renying Chang
Keyword(s):  
Lower Bound ◽  
Perfect Matching ◽  
Harmonic Index ◽  
Molecular Graphs ◽  
Degree Of A Vertex ◽  
Bicyclic Graphs ◽  
Sharp Lower Bound ◽  
Given Size Of Matching

The harmonic index H(G) 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) denotes the degree of a vertex u in G. In this paper, we first present a sharp lower bound on the harmonic index of bicyclic conjugated molecular graphs (bicyclic graphs with perfect matching). Also a sharp lower bound on the harmonic index of bicyclic graphs is given in terms of the order and given size of matching.

Load More ...
Sign in / Sign up

Export Citation Format

Share Document