On Clique Version of the Randic Index
From MaRDI portal
Publication:6402860
Abstract: In this paper, we first review the weighted-versiion of the handshaking lemma based on the idea of a weighted vertex-edge incidence matrix of a given graph . Then, we obtain a generalized version of the handshaking lemma based on the concept of the clique value. We also define a generalized version of Randic index. More importantly, we prove an upper bound for the generalized Randic index of a graph . We finally concluse the paper with some disscussions about possible future works.
This page was built for publication: On Clique Version of the Randic Index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402860)
