scholarly journals First General Zagreb Index of Generalized F-sum Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-16 ◽  
Author(s):  
H. M. Awais ◽  
Muhammad Javaid ◽  
Akbar Ali
Keyword(s):  
Real Number ◽  
Cartesian Product ◽  
Randić Index ◽  
Zeroth Order ◽  
Zagreb Index ◽  
Randic Index

The first general Zagreb (FGZ) index (also known as the general zeroth-order Randić index) of a graph G can be defined as M γ G = ∑ u v ∈ E G d G γ − 1 u + d G γ − 1 v , where γ is a real number. As M γ G is equal to the order and size of G when γ = 0 and γ = 1 , respectively, γ is usually assumed to be different from 0 to 1. In this paper, for every integer γ ≥ 2 , the FGZ index M γ is computed for the generalized F-sums graphs which are obtained by applying the different operations of subdivision and Cartesian product. The obtained results can be considered as the generalizations of the results appeared in (IEEE Access; 7 (2019) 47494–47502) and (IEEE Access 7 (2019) 105479–105488).

scholarly journals Some Upper Bounds on the First General Zagreb Index

2022 ◽  
Vol 2022 ◽  
pp. 1-4
Author(s):  
Muhammad Kamran Jamil ◽  
Aisha Javed ◽  
Ebenezer Bonyah ◽  
Iqra Zaman
Keyword(s):  
Minimum Degree ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Randić Index ◽  
Zeroth Order ◽  
Zagreb Index ◽  
Randic Index ◽  
Independent Number ◽  
General Randić Index ◽  
General Randic Index

The first general Zagreb index M γ G or zeroth-order general Randić index of a graph G is defined as M γ G = ∑ v ∈ V d v γ where γ is any nonzero real number, d v is the degree of the vertex v and γ = 2 gives the classical first Zagreb index. The researchers investigated some sharp upper and lower bounds on zeroth-order general Randić index (for γ < 0 ) in terms of connectivity, minimum degree, and independent number. In this paper, we put sharp upper bounds on the first general Zagreb index in terms of independent number, minimum degree, and connectivity for γ . Furthermore, extremal graphs are also investigated which attained the upper bounds.

scholarly journals Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number

2021 ◽  
Vol 7 (2) ◽  
pp. 2529-2542
Author(s):  
Chang Liu ◽  
◽  
Jianping Li
Keyword(s):  
Real Number ◽  
Lower Bounds ◽  
Domination Number ◽  
Upper And Lower Bounds ◽  
Randić Index ◽  
Extremal Graphs ◽  
Zeroth Order ◽  
Randic Index ◽  
General Randić Index ◽  
General Randic Index

<abstract><p>The zeroth-order general Randić index of graph $ G = (V_G, E_G) $, denoted by $ ^0R_{\alpha}(G) $, is the sum of items $ (d_{v})^{\alpha} $ over all vertices $ v\in V_G $, where $ \alpha $ is a pertinently chosen real number. In this paper, we obtain the sharp upper and lower bounds on $ ^0R_{\alpha} $ of trees with a given domination number $ \gamma $, for $ \alpha\in(-\infty, 0)\cup(1, \infty) $ and $ \alpha\in(0, 1) $, respectively. The corresponding extremal graphs of these bounds are also characterized.</p></abstract>

scholarly journals On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree

2018 ◽  
Vol 10 (02) ◽  
pp. 1850015 ◽  
Author(s):  
Sohaib Khalid ◽  
Akbar Ali
Keyword(s):  
Real Number ◽  
Fixed Number ◽  
Randić Index ◽  
Zeroth Order ◽  
Positive Real ◽  
Randic Index ◽  
General Randić Index ◽  
General Randic Index ◽  
Pendent Vertices ◽  
Number Of Segments

The zeroth-order general Randić index (usually denoted by [Formula: see text]) and variable sum exdeg index (denoted by [Formula: see text]) of a graph [Formula: see text] are defined as [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is degree of the vertex [Formula: see text], [Formula: see text] is a positive real number different from 1 and [Formula: see text] is a real number other than [Formula: see text] and [Formula: see text]. A segment of a tree is a path [Formula: see text], whose terminal vertices are branching or/and pendent, and all non-terminal vertices (if exist) of [Formula: see text] have degree 2. For [Formula: see text], let [Formula: see text], [Formula: see text], [Formula: see text] be the collections of all [Formula: see text]-vertex trees having [Formula: see text] pendent vertices, [Formula: see text] segments, [Formula: see text] branching vertices, respectively. In this paper, all the trees with extremum (maximum and minimum) zeroth-order general Randić index and variable sum exdeg index are determined from the collections [Formula: see text], [Formula: see text], [Formula: see text]. The obtained extremal trees for the collection [Formula: see text] are also extremal trees for the collection of all [Formula: see text]-vertex trees having fixed number of vertices with degree 2 (because the number of segments of a tree [Formula: see text] can be determined from the number of vertices of [Formula: see text] having degree 2 and vice versa).

scholarly journals Bounds on General Randić Index for F-Sum Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Xu Li ◽  
Maqsood Ahmad ◽  
Muhammad Javaid ◽  
Muhammad Saeed ◽  
Jia-Bao Liu
Keyword(s):  
Molecular Graph ◽  
Randić Index ◽  
Lower And Upper Bounds ◽  
First Zagreb Index ◽  
Zagreb Index ◽  
Randic Index ◽  
Structure Activity ◽  
General Randić Index ◽  
General Randic Index ◽  
The First Zagreb Index

A topological invariant is a numerical parameter associated with molecular graph and plays an imperative role in the study and analysis of quantitative structure activity/property relationships (QSAR/QSPR). The correlation between the entire π-electron energy and the structure of a molecular graph was explored and understood by the first Zagreb index. Recently, Liu et al. (2019) calculated the first general Zagreb index of the F-sum graphs. In the same paper, they also proposed the open problem to compute the general Randić index RαΓ=∑uv∈EΓdΓu×dΓvα of the F-sum graphs, where α∈R and dΓu denote the valency of the vertex u in the molecular graph Γ. Aim of this paper is to compute the lower and upper bounds of the general Randić index for the F-sum graphs when α∈N. We present numerous examples to support and check the reliability as well as validity of our bounds. Furthermore, the results acquired are the generalization of the results offered by Deng et al. (2016), who studied the general Randić index for exactly α=1.

scholarly journals On the Number of Spanning Trees of Graphs

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Ş. Burcu Bozkurt ◽  
Durmuş Bozkurt
Keyword(s):  
Spanning Trees ◽  
Vertex Degree ◽  
Randić Index ◽  
First Zagreb Index ◽  
Zagreb Index ◽  
Connected Graphs ◽  
Randic Index ◽  
Number Of Spanning Trees

We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices(n), the number of edges(m), maximum vertex degree(Δ1), minimum vertex degree(δ),…first Zagreb index(M1),and Randić index(R-1).

scholarly journals Connected (n,m)-graphs with minimum and maximum zeroth-order general Randić index

2007 ◽  
Vol 155 (8) ◽  
pp. 1044-1054 ◽  
Author(s):  
Yumei Hu ◽  
Xueliang Li ◽  
Yongtang Shi ◽  
Tianyi Xu
Keyword(s):  
Randić Index ◽  
Zeroth Order ◽  
Randic Index ◽  
General Randić Index ◽  
General Randic Index

scholarly journals On Leap Reduced Reciprocal Randic and Leap Reduced Second Zagreb Indices of Some Graphs

2019 ◽  
Vol 3 (2) ◽  
pp. 27-35
Author(s):  
Fazal Dayan ◽  
Muhammad Javaid ◽  
Muhammad Aziz ur Rehman
Keyword(s):  
Topological Indices ◽  
Randić Index ◽  
Zagreb Index ◽  
Randic Index ◽  
Zagreb Indices ◽  
Second Zagreb Index ◽  
Second Degree

Naji et al. introduced the leap Zagreb indices of a graph in 2017 which are new distance-degree-based topological indices conceived depending on the second degree of vertices. In this paper, we have defined the first and second leap reduced reciprocal Randic index and leap reduced second Zagreb index for selected wheel related graphs.

Sign in / Sign up

Export Citation Format

Share Document