Searcharxiv⌕ Search

arXiv subjects

Suresh Elumalai

Publications and source records attributed to Suresh Elumalai.

3 recordsLinked to original sources

Note on VDB Topological Indices of k-Cyclic Graphs

Let $G$ be a connected graph with $n$ vertices and $m$ edges. The vertex-degree-based topological index (VDB) (or graphical function-index) $TI(G)$ of $G$ with edge-weight function $I(x,y)$ is defined as $$TI(G)=\sum\limits_{uv\in E(G)}I(d_{u},d_{v}),$$ where $I(x,y)>0$ is a symmetric real function with $x\geq 1$ and $y\geq 1$, $d_{u}$ is the degree of vertex $u$ in $G$. In this note, we deduce a number of previously established results, and state a few new. For a VDB topological index $TI$ with the property $P^{*}$, we can obtain the minimum $k$-cyclic (chemical) graphs for $k\geq3$, $n\geq 5(k-1)$. These VDB topological indices include the Sombor index, the general Sombor index, the $p$-Sombor index, the general sum-connectivity index and so on. Thus this note extends the results of Liu et al. [H. Liu, L. You, Y. Huang, Sombor index of c-cyclic chemical graphs, MATCH Commun. Math. Comput. Chem. 90 (2023) 495-504] and Ali et al. [A. Ali, D. Dimitrov, Z. Du, F. Ishfaq, On the extremal graphs for general sum-connectivity index $(χ_α)$ with given cyclomatic number when $α>1$, Discrete Appl. Math. 257 (2019) 19-30].

math.GM↗

The minimum ABS index of trees with given number of pendent vertices

The recently developed atom-bond sum-connection (ABS) index is a variation of the well-studied graph-based molecular descriptors connectivity (Randic), atom-bond connectivity, and sum-connectivity indices.We present the minimum ABS index of trees with a given number of pendent vertices in this paper, which provides a solution to the problem proposed by A. Ali, I. Gutman and I. Redzepovic, Atom-Bond Sum-Connectivity Index of Unicyclic Graphs and Some Applications, Electron. J. Math.(2023) 1-7

math.CO↗

On the Complementary Equienergetic Graphs

Energy of a simple graph $G$, denoted by $\mathcal{E}(G)$, is the sum of the absolute values of the eigenvalues of $G$. Two graphs with the same order and energy are called equienergetic graphs. A graph $G$ with the property $G\cong \overline{G}$ is called self-complementary graph, where $\overline{G}$ denotes the complement of $G$. Two non-self-complementary equienergetic graphs $G_1$ and $G_2$ satisfying the property $G_1\cong \overline{G_2}$ are called complementary equienergetic graphs. Recently, Ramane et al. [Graphs equienergetic with their complements, MATCH Commun. Math. Comput. Chem. 82 (2019) 471-480] initiated the study of the complementary equienergetic regular graphs and they asked to study the complementary equienergetic non-regular graphs. In this paper, by developing some computer codes and by making use of some software like Nauty, Maple and GraphTea, all the complementary equienergetic graphs with at most 10 vertices as well as all the members of the graph class $Ω=\{G \ : \ \mathcal{E}(L(G)) = \mathcal{E}(\overline{L(G)}) \text{, the order of $G$ is at most 10}\}$ are determined, where $L(G)$ denotes the line graph of $G$. In the cases where we could not find the closed forms of the eigenvalues and energies of the obtained graphs, we verify the graph energies using a high precision computing (2000 decimal places) of Maple. A result about a pair of complementary equienergetic graphs is also given at the end of this paper.

math.CO↗