相关论文: Maximizing the Mostar index for bipartite graphs a…

In 1996, Michael Stiebitz proved that if $G$ is a simple graph with $\delta(G)\geq s+t+1$ and $s,t\in \mathbb{Z}_{\geq 0}$, then $V(G)$ can be partitioned into two sets $A$ and $B$ such that $\delta(G[A])\geq s$ and $\delta(G[B])\geq t$. In…

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore-like…

Graovac-Ghorbani index is a new version of the atom-bond connectivity index. D. Pacheco et al. [D. Pacheco, L. de Lima, C. S. Oliveira, On the Graovac-Ghorbani Index for Bicyclic Graph with No Pendent Vertices, MATCH Commun. Math. Comput.…

A graph $G$ consists of two parts, the vertices and edges. The vertices constitute the vertex set $V(G)$ and the edges, the edge set. An edge \( e=xy \), \( ev \)-dominates not only the vertices incident to it but also those adjacent to…

In an $r$-partite graph, an independent transversal of size $s$ (ITS) consists of $s$ vertices from each part forming an independent set. Motivated by a question from Bollob\'as, Erd\H{o}s, and Szemer\'edi (1975), Di Braccio and Illingworth…

For a connected graph $G$, let $\mu(G)$ denote the distance spectral radius of $G$. A matching in a graph $G$ is a set of disjoint edges of $G$. The maximum size of a matching in $G$ is called the matching number of $G$, denoted by…

The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize for every~$n$ all…

Let $i_t(G)$ denote the number of independent sets of size $t$ in a graph $G$. Levit and Mandrescu have conjectured that for all bipartite $G$ the sequence $(i_t(G))_{t \geq 0}$ (the {\em independent set sequence} of $G$) is unimodal. We…

Sombor index is a novel topological index, which was introduced by Gutman and defined for a graph $G$ as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}=d_{G}(u)$ denotes the degree of vertex $u$ in graph $G$.…

This paper presents the applications of Eigenvalues and Eigenvectors (as part of spectral decomposition) to analyze the bipartivity index of graphs as well as to predict the set of vertices that will constitute the two partitions of graphs…

Suppose $G$ is a simple graph with edge set $E(G)$. The Randi\'{c} index $R(G)$ is defined as $R(G)=\sum_{uv\in E(G)}\frac{1}{\sqrt{deg_{G}(u)deg_{G}(v)}}$, where $deg_G(u)$ denotes the vertex degree of $u$ in $G$. In this paper, the first…

In this paper, we focus on comparing the first and second Zagreb-Fermat eccentricity indices of graphs. We show that $$\frac{\sum_{uv\in E\left( G \right)}{\varepsilon_3\left( u \right) \varepsilon_3\left( v \right)}}{m\left( G \right)}…

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…

Boxicity of a graph $G(V,$ $E)$, denoted by $box(G)$, is the minimum integer $k$ such that $G$ can be represented as the intersection graph of axis parallel boxes in $\mathbb{R}^k$. The problem of computing boxicity is inapproximable even…

In this paper, we investigate the Tur\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\'an number of the 1-subdivision of $K_{s,t}^+$, where…

Motivated by the theorem of Gy\H ori and Lov\'asz, we consider the following problem. For a connected graph $G$ on $n$ vertices and $m$ edges determine the number $P(G,k)$ of unordered solutions of positive integers $\sum_{i=1}^k m_i = m$…

In this paper, we investigate the Diminished Sombor index (DSO), a recently introduced degree-based topological index for a simple graph $G$, defined as \[ DSO(G) = \sum_{uv \in E} \frac{\sqrt{d_u^2+d_v^2}}{d_u+d_v}, \] where $d_u$ denotes…

The {\it Randi\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is…

Let $G$ be a connected graph. The Steiner distance $d(S)$ of a set $S$ of vertices is the minimum size of a connected subgraph of $G$ containing all vertices of $S$. For $k\in \mathbb{N}$, the Steiner $k$-Wiener index $SW_k(G)$ is defined…