English
Related papers

Related papers: F-Index of Some Graph Operations

200 papers

There are various topological indices such as degree based topological indices, distance based topological indices and counting related topological indices etc. These topological indices correlate certain physicochemical properties such as…

Combinatorics · Mathematics 2016-05-09 Shaohui Wang , Jia-Bao Liu , Chunxiang Wang , Sakander Hayat

Let $X$ be a non-empty ground set and $\mathscr{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\to \mathscr{P}(X)$ such that the induced function $f^*:E(G) \to…

General Mathematics · Mathematics 2017-01-03 N. K. Sudev

Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…

Combinatorics · Mathematics 2017-10-06 Nilanjan De

Topological indices are parameters associated with graphs that have many applications in different areas such as mathematical chemistry. Among various topological indices, the Wiener index is classical \cite{w}. In this paper, we prove a…

Combinatorics · Mathematics 2023-03-23 P. Gangaeswari , K. Selvakumar , G. Arunkumar

The edge Szeged index of a graph $G$ is defined as $Sz_{e}(G)=\sum\limits_{uv\in E(G)}m_{u}(uv|G)m_{v}(uv|G)$, where $m_{u}(uv|G)$ (resp., $m_{v}(uv|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the…

Combinatorics · Mathematics 2018-06-06 Shengjie He

Let $G=(V,E)$ be a graph and $e=uv\in E$. Define $n_u(e,G)$ be the number of vertices of $G$ closer to $u$ than to $v$. The number $n_v(e,G)$ can be defined in an analogous way. The Mostar index of $G$ is a new graph invariant defined as…

Combinatorics · Mathematics 2021-06-15 Nima Ghanbari , Saeid Alikhani

The vertex PI index is a distance--based molecular structure descriptor, that recently found numerous chemical applications. In order to increase diversity of this topological index for bipartite graphs, we introduce weighted version…

Combinatorics · Mathematics 2015-03-19 Aleksandar Ili\' c , Nikola Milosavaljevi\' c

For a non-empty ground set $X$, finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \to \mathcal{P}(X)$, where $\mathcal{P}(X)$ is the power set of the set $X$. A…

Combinatorics · Mathematics 2015-03-31 N. K. Sudev , K. A. Germina , K. P. Chithra

For a molecular graph, the first multiplicative Zagreb index $\Pi_1$ is equal to the product of the square of the degree of the vertices, while the second multiplicative Zagreb index $\Pi_2$ is equal to the product of the endvertex degree…

Combinatorics · Mathematics 2017-05-09 Shaohui Wang , Chunxiang Wang , Lin Chen

Recently, a bond-additive topological descriptor, named as the Mostar index, has been introduced as a measure of peripherality in networks. For a connected graph $G$, the Mostar index is defined as $Mo(G) = \sum_{e=uv \in E(G)} |n_u(e) -…

Combinatorics · Mathematics 2021-03-15 Niko Tratnik

Very recently, the first geometric-arithmetic index $GA$ and arithmetic-geometric index $AG$ were introduced in mathematical chemistry. In the present paper, we first obtain some lower and upper bounds on $AG$ and characterize the extremal…

Combinatorics · Mathematics 2020-10-09 Shu-Yu Cui , Weifan Wang , Gui-Xian Tian , Baoyindureng Wu

Let G be a graph with vertex set V (G) and edge set E(G). The first generalized multiplicative Zagreb index of G is M_1(G) and the second multiplicative Zagreb index is M_2(G). The multiplicative Zagreb indices have been the focus of…

Combinatorics · Mathematics 2016-02-16 Shaohui Wang , Bing Wei

Let $X$ be a non-empty ground set and $\mathcal{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\to \mathcal{P}(X)$ such that the induced function $f^\oplus:E(G) \to…

General Mathematics · Mathematics 2016-10-05 P. K. Ashraf , K. A. Germina , N. K. Sudev

The concept of the \emph{Gutman index}, denoted $Gut(G)$ was introduced for a connected undirected graph $G$. In this note we apply the concept to the underlying graphs of the family of Jaco graphs, (\emph{directed graphs by definition}),…

Combinatorics · Mathematics 2015-11-25 Johan Kok , Susanth C , Sunny Joseph Kalayathankal

In this paper, we examine a specific type of random chains and propose an unified approach to studying the degree-based topological indices, including their extreme values. We derive explicit analytical expressions for the expected values…

Probability · Mathematics 2024-11-08 Sayle Sigarreta , Hugo Cruz-Suarez , Sergio Torralbas Fitz

The Zagreb index of a hypergraph is defined as the sum of the squares of the degrees of its vertices. A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called bicyclic if $n=m(k-1)-1$. In this paper, we determine the…

Combinatorics · Mathematics 2025-06-11 Hong Zhou , Changjiang Bu

The sigma index of a graph, defined as the population variance of its degree sequence, is a fundamental measure of structural irregularity. In this paper, we introduce and systematically investigate its natural extension to fuzzy graphs,…

General Mathematics · Mathematics 2026-04-16 Duaa Abdullah

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

In this note, we introduce a new topological index of a graph G that we term peripheral hyper-Wiener index, denoted PWW(G). It is a natural extension of the peripheral Wiener index PW(G) initiated in [NB17] and is to the peripheral Wiener…

Combinatorics · Mathematics 2025-12-16 Andry N. Rabenantoandro

For a simple graph, we introduce a notion of the star sequence and prove that the star sequence and the frequently sequences of a graph are inverses of each other from a combinatorial point of view. As a consequence, we express the general…

Combinatorics · Mathematics 2018-09-19 Leonid Bedratyuk , Oleg Savenko
‹ Prev 1 3 4 5 6 7 10 Next ›