English
Related papers

Related papers: On Certain Topological Indices of Signed Graphs

200 papers

The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of \v{S}olt{\'e}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being…

Combinatorics · Mathematics 2021-06-23 Sam Spiro

Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u \in V$. Recently, this graph invariant gained interest in the…

Discrete Mathematics · Computer Science 2015-03-20 Hosam Abdo , Nathann Cohen , Darko Dimitrov

Topological indices are real numbers invariant under graph isomorphisms. Chromatic analogue of topological indices has been introduced recently in literature in 2017. Mainly, chromatic versions of Zagreb indices are studied lately. This…

General Mathematics · Mathematics 2018-10-09 Smitha Rose , Sudev Naduvath

In the last forty years, many scientists used graph theory to develop mathematical models for analyzing structures and properties of various chemical compounds. In this paper, we will establish formulas and bounds for generalized first…

Combinatorics · Mathematics 2024-09-11 Sanju Vaidya , Jeff Chang

In this paper, we investigate The relationship between the Albertson index and the first Zagreb index for trees. For a tree $T=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges, we provide several bounds and exact formulas for these two…

Combinatorics · Mathematics 2025-06-03 Jasem Hamoud , Alexei Belov-Kanel , Duaa Abdullah

A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$,…

Combinatorics · Mathematics 2024-08-15 Cristian M. Conde , Ezequiel Dratman , Luciano N. Grippo

Augmented Zagreb Index is a newly defined degree based topological invariant which has been well established for its better correlation properties and is defined as $AZI(G)= \sum_{uv\in E(G)}(\frac{d_G (u)d_G (v)}{d_G (u)+ d_G (v)-2})^3 $,…

Combinatorics · Mathematics 2016-06-02 Nazeran Idrees , Afshan Sadiq , Muhammad Jawwad Saif , Asia Rauf

{\small The Wiener index $W(G)$ of a graph $G$ is the sum of the distances between all pairs of vertices in the graph. The Szeged index $Sz(G)$ of a graph $G$ is defined as $Sz(G)=\sum_{e=uv \in E}n_u(e)n_v(e)$ where $n_u(e)$ and $n_v(e)$…

Combinatorics · Mathematics 2012-10-25 Lily Chen , Xueliang Li , Mengmeng Liu

Graph operations are crucial for building complicated network architectures from simple graphs. In [7], authors defined two new variants of Corona product and investigated some topological indices. In this paper, we extended the work and…

Combinatorics · Mathematics 2021-11-23 Rao Tabish , Muhammad Kamran Jamil , Muhammad Waheed

Let $\prod(G)$ be Multiplicative Zagreb index of a graph G. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which has been the interest of researchers in the filed of material…

Combinatorics · Mathematics 2016-07-19 Shaohui Wang , Bing Wei

The topological indices $irr(G)$ related to the \emph{first Zagreb index,} $M_1(G)$ and the \emph{second Zagreb index,} $M_2(G)$ are the oldest irregularity measures researched. Alberton $[3]$ introduced the \emph{irregularity} of $G$ as…

Combinatorics · Mathematics 2014-09-16 Johan Kok , Vivian Mukungunugwa

Let $G_1=(V_1,E_1)$ and $G_2=(V_2,E_2)$ be two graphs with disjoint vertex sets $V_1$ and $V_2$. Let $u_1 \in V_1$ and $u_2 \in V_2$. A splice of $G_1$ and $G_2$ by vertices $u_1$ and $u_2$, $\mathcal{S}(G_1,G_2;u_1,u_2)$, is defined by…

Combinatorics · Mathematics 2016-11-10 Reza Sharafdini , Ivan Gutman

Let $\mathbb{G} = (\mathcal{V}, \mathcal{E})$ be a simple connected graph, where $\mathcal{V}$ and $\mathcal{E}$ denote the vertex and edge sets, respectively. The first Zagreb index is defined as $\mathcal{M}_{1}(\mathbb{G}) = \sum_{v \in…

General Mathematics · Mathematics 2025-08-08 Waqar Ali , Mohamad Nazri Bin Husin , Muhammad Faisal Nadeem , Muqaddas Jabin

Let $G$ be a simple connected graph with the vertex set $V(G)$ and $d_{B}^2(u,v)$ be the biharmonic distance between two vertices $u$ and $v$ in $G$. The biharmonic index $BH(G)$ of $G$ is defined as $$BH(G)=\frac{1}{2}\sum\limits_{u\in…

Combinatorics · Mathematics 2021-10-20 Zhen Lin

The harmonic index of a graph $G$ is defined as the sum of weights $\frac{2}{deg(v) + deg(u)}$ of all edges $uv$ of $E (G)$, where $deg (v)$ denotes the degree of a vertex $v$ in $V (G)$. In this note we generalize results of [L. Zhong, The…

Combinatorics · Mathematics 2012-04-17 Aleksandar Ilic

Motivated by the recently introduced topological index, the Somber index, we define a new topological index of a graph in this paper, we call it Sombor coindex. The Sombor coindex is defined by considering analogous contributions from the…

Combinatorics · Mathematics 2022-09-21 Phanjoubam Chinglensana , Sainkupar Mn Mawiong

The forgotten topological index or F-index of a graph is defined as the sum of cubes of the degree of all the vertices of the graph. In this paper we study the F-index of four operations related to the lexicographic product on graphs which…

Discrete Mathematics · Computer Science 2017-06-05 Nilanjan De

The first and the second Zagreb eccentricity index of a graph $G$ are defined as $E_1(G)=\sum_{v\in V(G)}\varepsilon_{G}(v)^{2}$ and $E_2(G)=\sum_{uv\in E(G)}\varepsilon_{G}(u)\varepsilon_{G}(v)$, respectively, where $\varepsilon_G(v)$ is…

Combinatorics · Mathematics 2019-12-16 Kexiang Xu , Kinkar Chandra Das , Sandi Klavžar , Huimin Li

In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple directed graph. Moreover, a realization of a realizable sequence…

Combinatorics · Mathematics 2007-05-23 Dhruv Mubayi , Todd G. Will , Douglas B. West

A signed graph is a simple graph with two types of edges: positive and negative edges. Switching a vertex $v$ of a signed graph corresponds to changing the type of each edge incident to $v$. A homomorphism from a signed graph $G$ to another…

Combinatorics · Mathematics 2021-05-13 Fabien Jacques , Alexandre Pinlou