English
Related papers

Related papers: F-Index of Some Graph Operations

200 papers

In this paper we study the Szeged index of partial cubes and hence generalize the result proved by V. Chepoi and S. Klav\v{z}ar, who calculated this index for benzenoid systems. It is proved that the problem of calculating the Szeged index…

Combinatorics · Mathematics 2018-08-28 Matevz Crepnjak , Niko Tratnik

The Hyperbolic Sombor index $HSO(G)$ of a graph $G$ is defined as \begin{align*} HSO(G) = \sum_{v_iv_j \in E(G)} \frac{\sqrt{d_i^{2}+d_j^{2}}}{\min\{d_i,d_j\}}, \end{align*} where $d_i$ and $d_j$ denote the degrees of the vertices $v_i$ and…

Combinatorics · Mathematics 2025-10-28 Kinkar Chandra Das , Sultan Ahmad

Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a powerful framework for quantifying structural resemblance.…

Combinatorics · Mathematics 2025-09-30 Matthias Dehmer , Izudin Redžepović , Niko Tratnik , Petra Žigert Pleteršek

Building upon the notion of Gutman index $\operatorname{SGut}(G)$, Mao and Das recently introduced the Steiner Gutman index by incorporating Steiner distance for a connected graph $G$. The \emph{Steiner Gutman $k$-index}…

Combinatorics · Mathematics 2021-07-14 Zhao Wang , Yaping Mao , Kinkar Chandra Das , Yilun Shang

In chemical graph theory, caterpillar trees have been an appealing model to represent the molecular structures of benzenoid hydrocarbon. Meanwhile, topological index has been thought of as a powerful tool for modeling quantitative…

Probability · Mathematics 2021-02-26 Panpan Zhang , Xiaojing Wang

A routing $R$ of a given connected graph $G$ of order $n$ is a collection of $n(n-1)$ simple paths connecting every ordered pair of vertices of $G$. The vertex-forwarding index $\xi(G,R)$ of $G$ with respect to $R$ is defined as the maximum…

Combinatorics · Mathematics 2012-04-13 Jun-Ming Xu , Min Xu

For a graph $G$, the first multiplicative Zagreb index $\prod_1(G) $ is the product of squares of vertex degrees, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of products of degrees of pairs of adjacent vertices.…

Combinatorics · Mathematics 2021-08-09 Shengjin Ji , Shaohui Wang , Tilahun Muche , Sakander Hayat

The degree-Kirchhoff index of a connected graph is defined as the sum of the reciprocals of the non-zero eigenvalues of the normalized Laplacian matrix, each multiplied by the graph's total degree. Several studies have recently obtained…

Combinatorics · Mathematics 2024-09-10 Md. Abdus Sahir , Sk. Md. Abu Nayeem

A coloring of a connected graph $G$ is a function $f$ mapping the vertex set of $G$ into the set of all integers. For any subgraph $H$ of $G$, we denote the sum of the values of $f$ on the vertices of $H$ as $f(H)$. If for any integer $k\in…

Combinatorics · Mathematics 2016-10-04 Chin-Lin Shiue , Hui-Chuan Lu

The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…

Discrete Mathematics · Computer Science 2024-03-11 Véronique Bruyère , Hadrien Mélot

A graph is a structure composed of a set of vertices (i.e.nodes, dots) connected to one another by a set of edges (i.e.links, lines). The concept of a graph has been around since the late 19$^\text{th}$ century, however, only in recent…

Data Structures and Algorithms · Computer Science 2010-12-24 Marko A. Rodriguez , Peter Neubauer

Let $D=(V,A)$ be a digraphs without isolated vertices. The first Zagreb index of a digraph $D$ defined as a summation over all arcs, $M_1(D)=\frac{1}{2}\sum\limits_{uv\in A}(d^{+}_{u}+d^{-}_v)$, where $d^{+}_u$(resp. $d^{-}_u$) denotes the…

Combinatorics · Mathematics 2022-05-31 Jiaxiang Yang , Hanyuan Deng

Many existing degree based topological indices can be classified as bond incident degree (BID) indices, whose general form is $BID(G)=\sum_{uv\in E(G)}$ $\Psi(d_{u},d_{v})$, where $uv$ is the edge connecting the vertices $u,v$ of the graph…

Combinatorics · Mathematics 2018-03-14 Akbar Ali , Darko Dimitrov

The Randi\'{c} index $R(G)$ of a graph $G$ is defined as the sum of $(d_i d_j)^{-1/2}$ over all edges $v_i v_j$ of $G$, where $d_i$ is the degree of the vertex $v_i$ in $G$. The radius $r(G)$ of a graph $G$ is the minimum graph eccentricity…

Combinatorics · Mathematics 2012-10-10 Hanyuan Deng , Zikai Tang , Jie Zhang

For a graph $G$, the first multiplicative Zagreb index $\prod_1$ is equal to the product of squares of the vertex degrees, and the second multiplicative Zagreb index $\prod_2$ is equal to the product of the products of degrees of pairs of…

Combinatorics · Mathematics 2016-11-21 Shaohui Wang , Chunxiang Wang , Jia-Bao Liu

A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \rightarrow2^{X}$ such that the function $f^{\oplus}:E(G)\rightarrow2^{X}-\{\emptyset\}$ defined by $f^{\oplus}(uv) = f(u){\oplus} f(v)$ for every $uv{\in} E(G)$ is…

Combinatorics · Mathematics 2014-03-25 N. K. Sudev , K. A. Germina

An atom $a$ of a molecular graph $G$ uniquely determines (resolves) a pair $(a_1,a_2)$ of atoms of $G$ if the distance between $a$ and $a_1$ is different from the distance between $a$ and $a_2$. In this paper, we quantify the involvement of…

Combinatorics · Mathematics 2014-08-04 Muhammad Salman , Imran Javaid , Muhammad Anwar Chaudhry

A numerical parameter, referred to as a topological index, is used to represent the molecular structure of a compound by analyzing its graph-theoretical characteristics. Topological indices are predictive methods for the physicochemical…

Materials Science · Physics 2024-06-19 H. M. Nagesh

In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes using the heat kernels of two higher-order…

Spectral Theory · Mathematics 2009-11-13 S. A. Fulling , P. Kuchment , J. H. Wilson

Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $\varphi$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{\varphi(d_u^+,d_v^-)}$,…

Combinatorics · Mathematics 2021-05-03 Hanyuan Deng , Jiaxiang Yang , Zikai Tang , Jing Yang , Meiling You