相关论文: Zagreb indices of subgroup generating bipartite gr…

We find Dirac-type sufficient conditions for a hypergraph $\mathcal H$ with few edges to be hamiltonian. We also show that these conditions provide that $\mathcal H$ is {\em super-pancyclic}, i.e., for each $A \subseteq V(\mathcal H)$ with…

In this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this…

For a graph $G$ with vertex set $V$, let N($G$) denote the number of nonempty subsets of $V$ that induce a connected graph in $G$. In this paper, we focus on determining N($G$) for $G$ in the family $\mathbb{B}_n$ of $n$-vertex bicyclic…

Let $G = (V, E)$ be a graph. The first Zagreb index and the forgotten topological index of a graph $G$ are defined respectively as $\sum_{u \in V} d^2(u)$ and $\sum_{u \in V} d^3(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. If the…

A biclique in a graph $G$ is a complete bipartite subgraph (not necessarily induced), and the least positive integer $k$ for which the vertex set of $G$ can be partitioned into at most $k$ bicliques is the biclique vertex partition number…

This paper presents new lower bounds for the first general Zagreb index $Z_{\alpha}(G)$ involving two, three, and four arbitrary degrees of vertices of a simple graph $G$. For the special cases $\alpha = 2$ and $\alpha = -2$, the results…

We study a symmetry problem for the $h$-polynomials of edge rings of bipartite graphs. Let $G$ be a bipartite graph and write $h(\mathbb{k}[G];t)=h_0+h_1t+\cdots+h_st^s$. We prove that if $\Bbbk[G]$ is pseudo-Gorenstein and $h_1=h_{s-1}$,…

For a connected graph $G$ on at least three vertices, the augmented Zagreb index (AZI) of $G$ is defined as $$AZI(G)=\sum_{uv\in E(G)}\left(\frac{d(u)d(v)}{d(u)+d(v)-2}\right)^{3},$$ being a topological index well-correlated with the…

Let $\mathcal{H}$ be a hypergraph on the non-empty finite vertex set $V(\mathcal{H})$ with the hyperedge set $E(\mathcal{H})$, where each hyperedge $e \in E(\mathcal{H})$ is a subset of $V(\mathcal{H})$ with at least two vertices. This…

Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…

In this paper we establish connections between common neighborhood Laplacian and common neighborhood signless Laplacian energies and the first Zagreb index of a graph $\mathcal{G}$. We introduce the concepts of CNL-hyperenergetic and…

Topological relations between three degree-based invariants of a connected graph G are investigated. We present novel inequalities including M1(G), M2(G) and F(G), and show that in all cases equality holds if G is a regular or a semiregular…

In the last forty years, many scientists used graph theory to develop mathematical models for analyzing structures and properties of various chemical compounds. In this paper, we will establish formulas and bounds for generalized first…

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))$,…

Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…

Lov\'asz (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let $b(G)$ denote the number of bricks. An edge $e$ is removable if $G-e$ is also…

The Szeged index of a graph is an invariant with several applications in chemistry. The power graph of a finite group $G$ is a graph having vertex set as $G$ in which two vertices $u$ and $v$ are adjacent if $v=u^m$ or $u=v^n$ for some…

Let $\hom(H,G)$ denote the number of homomorphisms from a graph $H$ to a graph $G$. Sidorenko's conjecture asserts that for any bipartite graph $H$, and a graph $G$ we have $$\hom(H,G)\geq…

The authors Mili$\breve{c}$evi$\acute{c}$ et al. introduced the reformulated Zagreb indices, which is a generalization of classical Zagreb indices of chemical graph theory. In the paper, we characterize the extremal properties of the first…

Of a given bipartite graph $G = (V, E)$, it is elementary to construct a bipartition in time $O(|V| + |E|)$. For a given $k$-graph $H = H^{(k)}$ with $k \geq 3$ fixed, Lov\'asz proved that deciding whether $H$ is bipartite is NP-complete.…