中文
相关论文

相关论文: Maximum Zagreb Indices Among All p-Quasi k-Cyclic …

200 篇论文

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…

组合数学 · 数学 2025-06-11 Hong Zhou , Changjiang Bu

The first Zagreb index $M_{1}$ of a graph is defined as the sum of the square of every vertex degree, and the second Zagreb index $M_{2}$ of a graph is defined as the sum of the product of vertex degrees of each pair of adjacent vertices.…

组合数学 · 数学 2020-06-02 Xiaocong He , Xiaobo He

For a simple graph $G$ with $n$ vertices and $m$ edges, the first Zagreb index and the second Zagreb index are defined as $M_1(G)=\sum_{v\in V}d(v)^2 $ and $M_2(G)=\sum_{uv\in E}d(u)d(v)$. In \cite{VGFAD}, it was shown that if a connected…

离散数学 · 计算机科学 2015-03-19 Hosam Abdo , Darko Dimitrov , Ivan Gutman

The first Zagreb index of a graph $G$ is the sum of the square of every vertex degree, while the second Zagreb index is the sum of the product of vertex degrees of each edge over all edges. In our work, we solve an open question about…

组合数学 · 数学 2017-09-07 Shengjin Ji , Shaohui Wang

Let $G$ be a graph with edge set $E(G)$. Denote by $d_w$ the degree of a vertex $w$ of $G$. The sigma index of $G$ is defined as $\sum_{uv\in E(G)}(d_u-d_v)^2$. A connected graph of order $n$ and size $n+k-1$ is known as a connected…

The revised Szeged index of a graph $G$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex…

组合数学 · 数学 2013-07-02 Lily Chen , Xueliang Li , Mengmeng Liu

The first Zagreb index $M_{1}(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_{2}(G)$ is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying…

组合数学 · 数学 2024-04-09 H. M. Nagesh

Let $D=(V,A)$ be a digraphs without isolated vertices. The first Zagreb index of a digraph $D$ defined as a summation over all arcs, $M_1(D)=\frac{1}{2}\sum\limits_{uv\in A}(d^{+}_{u}+d^{-}_v)$, where $d^{+}_u$(resp. $d^{-}_u$) denotes the…

组合数学 · 数学 2022-05-31 Jiaxiang Yang , Hanyuan Deng

Let $\prod(G)$ be Multiplicative Zagreb index of a graph G. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which has been the interest of researchers in the filed of material…

组合数学 · 数学 2016-07-19 Shaohui Wang , Bing Wei

We examine the quantity \[S(G) = \sum_{uv\in E(G)} \min(\text{deg } u, \text{deg } v)\] over sets of graphs with a fixed number of edges. The main result shows the maximum possible value of $S(G)$ is achieved by three different classes of…

组合数学 · 数学 2018-01-09 Ashwin Sah , Mehtaab Sawhney

A connected graph $G$ is said to be $k$-connected if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are deleted. In this paper, for a connected graph $G$ with sufficiently large order, we present a…

组合数学 · 数学 2021-09-17 Peng-Li Zhang , Lihua Feng , Weijun Liu , Xiao-Dong Zhang

The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular…

组合数学 · 数学 2015-03-30 Wei-Gang Yuan , Xiao-Dong Zhang

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

组合数学 · 数学 2022-11-28 Niranjan Balachandran , Anish Hebbar

Let G be a simple connected molecular graph with vertex set $V(G)$ and edge set $E(G)$. One important modification of classical Zagreb index, called hyper Zagreb index $HM(G)$ is defined as the sum of squares of the degree sum of the…

离散数学 · 计算机科学 2017-03-27 Nilanjan De

For a (molecular) graph, the first multiplicative Zagreb index $\prod_1(G) $ is the product of the square of every vertex degree, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of the products of degrees of pairs of…

组合数学 · 数学 2017-04-25 Shaohui Wang

Let ${\mathcal G}_n$ be the set of class of graphs of order $n$. The first Zagreb index $M_1(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_2(G)$ is equal to the sum of the products of the…

组合数学 · 数学 2023-09-26 Batmend Horoldagva , Kinkar Chandra Das

Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first…

组合数学 · 数学 2015-03-27 Monica Bianchi , Alessandra Cornaro , José Luis Palacios , Anna Torriero

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…

组合数学 · 数学 2022-05-31 Muhuo Liu , Shumei Pang , Francesco Belardo , Akbar Ali

For a graph $G$, the first multiplicative Zagreb index $\prod_1(G) $ is the product of squares of vertex degrees, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of products of degrees of pairs of adjacent vertices.…

组合数学 · 数学 2021-08-09 Shengjin Ji , Shaohui Wang , Tilahun Muche , Sakander Hayat

Let $G$ be a group and $L(G)$ be the set of all subgroups of $G$. The subgroup generating bipartite graph $\mathcal{B}(G)$ defined on $G$ is a bipartite graph whose vertex set is partitioned into two sets $G \times G$ and $L(G)$, and two…

群论 · 数学 2025-01-13 Shrabani Das , Ahmad Erfanian , Rajat Kanti Nath
‹ 上一页 1 2 3 10 下一页 ›