Results 41 to 50 of about 157 (86)

New bounds for Randic and GA indices

, 2013
The main goal of this paper is to present some new lower and upper bounds for the Randic and GA indices in terms of Zagreb and modified Zagreb indices.MSC: 05C05, 05C20, 05C90.
V. Lokesha, B. S. Shetty, P. Ranjini, I. N. Cangul, A. Cevik   +4 more
semanticscholar   +1 more source

Study on (r, s)-generalised transformation graphs, a novel perspective based on transformation graphs

Main Group Metal Chemistry
For a graph Q=(V,E){\mathbb{Q}}=\left({\mathbb{V}},{\mathbb{E}}), the transformation graph are defined as graphs with vertex set being V(Q)∪E(Q){\mathbb{V}}\left({\mathbb{Q}})\cup {\mathbb{E}}\left({\mathbb{Q}}) and edge set is described following ...
Ali Parvez, Baby Annmaria, Xavier D. Antony, Theertha Nair A., Ali Haidar, Kirmani Syed Ajaz K.   +5 more
doaj   +1 more source

Retraction Note: On the Kirchhoff matrix, a new Kirchhoff index and the Kirchhoff energy

, 2014
The main purpose of this paper is to define and investigate the Kirchhoff matrix, a new Kirchhoff index, the Kirchhoff energy and the Kirchhoff Estrada index of a graph.
A. D. Maden, A. Cevik, I. N. Cangul, K. Das   +3 more
semanticscholar   +1 more source

The weighted version of the handshaking lemma with an application

, 2014
The purpose of the present note is to establish the weighted version of the handshaking lemma with an application to chemical graph theory.MSC:05C90.
Baoyindureng Wu
semanticscholar   +1 more source

Some new bounds on resolvent energy of a graph

Open Mathematics
Let GG be a simple graph of order nn with eigenvalues λ1≥λ2≥…≥λn.{\lambda }_{1}\ge {\lambda }_{2}\ge \ldots \ge {\lambda }_{n}. The resolvent energy of GG is a spectrum-based graph invariant defined as ER(G)=∑i=1n(n−λi)−1.{\rm{ER}}(G)={\sum }_{i=1}^{n ...
Altındağ İlkay, Bozkurt Altındağ Şerife Burcu   +1 more
doaj   +1 more source

Steiner Degree Distance of Two Graph Products

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈Sdeg⁡G(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj   +1 more source

Unicyclic graphs with given number of pendent vertices and minimal energy

, 2007
The energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all eigenvalues of the adjacency matrix of G. Let G(n, l, p) denote the set of all unicyclic graphs on n vertices with girth and pendent vertices being l ( 3) and p (
Hongbo Hua, Maolin Wang
semanticscholar   +1 more source

Degree-based topological properties of borophene sheets

Main Group Metal Chemistry
This study examines many innovative topological numbers and establishes mathematical interpretations for boron clusters and borophene coverings. The general Randic index, arithmetic index, and Albertson index are discussed in this work for the alpha ...
Al Khabyah Ali, Ahmad Ali, Azeem Muhammad, Koam Ali N. A.   +3 more
doaj   +1 more source

Metric Dimension of Irregular Convex Triangular Networks

AKCE International Journal of Graphs and Combinatorics
Irregular convex triangular networks consist of the interior of a 6-sided convex polygon drawn on the infinite triangular network. Formal description of these applicable networks is provided.
S. Prabhu, D. Sagaya Rani Jeba, M. Arulperumjothi, Sandi Klavžar   +3 more
doaj   +1 more source

On the maximum atom-bond sum-connectivity index of molecular trees

AKCE International Journal of Graphs and Combinatorics
Let G be a graph with V(G) and E(G), as vertex set and edge set, respectively. The atom-bond sum-connectivity (ABS) index is a vertex-based topological index which is defined as [Formula: see text] where [Formula: see text] is the degree of the vertex a.
Zhonglin Cheng, Akbar Jahanbani, Jun Wang   +2 more
doaj   +1 more source