Related papers: Extremal graphs with maximum complementary second …
The concepts of domination and topological index hold great significance within the realm of graph theory. Therefore, it is pertinent to merge these concepts to derive the domination index of a graph. A novel concept of the domination index…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…
For a simple graph we introduce notions of the double star sequence, the double star frequently sequence and prove that these sequences are inverses of each other. As a consequence, we express the general second Zagreb index in terms of the…
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…
To estimate the lower bound for the chromatic number of a graph $G$, Lov\'asz associated a simplicial complex $\mathcal{N}(G)$ called the neighborhood complex and relates the topological connectivity of $\mathcal{N}(G)$ to the chromatic…
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The Sombor and reduced Sombor indices of $G$ are defined as $SO(G)=\sum_{uv\in E(G)}\sqrt{deg_G(u)^2+deg_G(v)^2}$ and $SO_{red}(G)=\sum_{uv\in…
The weighted Szeged index and the weighted vertex-PI index of a connected graph $G$ are defined as $wSz(G) = \sum_{e=uv \in E(G)} (deg (u) + deg (v))n_u(e)n_v(e)$ and $wPI_v(G) = \sum_{e=uv \in E(G)} (deg(u) + deg(v))( n_u(e) + n_v(e))$,…
In this work we obtain new lower and upper optimal bounds of general Sombor indices. Specifically, we have inequalities for these indices relating them with other indices: the first Zagreb index, the forgotten index and the first variable…
An extremal graph for a graph $H$ on $n$ vertices is a graph on $n$ vertices with maximum number of edges that does not contain $H$ as a subgraph. Let $T_{n,r}$ be the Tur\'{a}n graph, which is the complete $r$-partite graph on $n$ vertices…
Erd\H{o}s proved an upper bound on the number of edges in an $n$-vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph family. F\"{u}redi, Kostochka and Luo showed that these two…
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…
The modified eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the total degree of neighboring vertices, over all vertices of the graph. This is a generalization of eccentric connectivity…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
The Second Neighborhood Conjecture of Seymour asserts that every oriented graph contains a vertex~$v$ satisfying $|\Npp(v)|\ge|\Np(v)|$. We introduce \emph{Pisa graphs} -- strongly connected oriented graphs~$D$ with $\Delta(D)=\max_{v\in…
In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. For graphs that turn out to be extremal explicit…
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…
The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give…
Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature.…
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…