通过增强型萨格勒布指数对图排序

Recently, Furtula et al. proposed a valuable predictive index in the study of the heat of formation in octanes and heptanes, the augmented Zagreb index(AZI index) of a graph G, which is defined as AZI(G) =∑uv∈E(G)( d_u d_v/d_u + d_v-2)~3,where E(G) is the edge set of G, d u and d v are the degrees of the terminal vertices u and v of edge uv, respectively. In this paper, we obtain the first five largest(resp., the first two smallest) AZI indices of connected graphs with n vertices. Moreover, we determine the trees of order n with the first three smallest AZI indices, the unicyclic graphs of order n with the minimum, the second minimum AZI indices, and the bicyclic graphs of order n with the minimum AZI index, respectively.     

On the spectral spread of bicyclic graphs with given girth

The spectral spread of a graph is defined to be the difference between the largest and the least eigenvalue of the adjacency matrix of the graph. A graph G is said to be bicyclic, if G is connected and |E(G)| = |V(G)|+ 1. Let B(n, g) be the set of bicyclic graphs on n vertices with girth g. In this paper some properties about the least eigenvalues of graphs are given, by which the unique graph with maximal spectral spread in B(n, g) is determined.     

零度为$n-7$的双圈符号图

Let Γ be a signed graph and A(Γ) be the adjacency matrix of Γ. The nullity ofΓ is the multiplicity of eigenvalue zero in the spectrum of A(Γ). In this paper, the connected bicyclic signed graphs(including simple bicyclic graphs) of order n with nullity n-7 are completely characterized.     

Comparison and Extremal Results on Three Eccentricity-based Invariants of Graphs

The first and second Zagreb eccentricity indices of graph G are defined as:E1(G)=∑(vi)∈V(G)εG(vi)~2,E2(G)=∑(vivj)∈E(G)εG(vi)εG(vj)whereεG(vi)denotes the eccentricity of vertex vi in G.The eccentric complexity C(ec)(G)of G is the number of different eccentricities of vertices in G.In this paper we present some results on the comparison between E1(G)/n and E2(G)/m for any connected graphs G of order n with m edges,including general graphs and the graphs with given C(ec).Moreover,a Nordhaus-Gaddum type result C(ec)(G)+C(ec)(■)is determined with extremal graphs at which the upper and lower bounds are attained respectively.     

Graphs with vertex rainbow connection number two

An edge colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. A vertex colored graph G is vertex rainbow connected if any two vertices are connected by a path whose internal vertices have distinct colors. The vertex rainbow connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G vertex rainbow connected. In 2011, Kemnitz and Schiermeyer considered graphs with rc(G) = 2.We investigate graphs with rvc(G) = 2. First, we prove that rvc(G) 2 if |E(G)|≥n-22 + 2, and the bound is sharp. Denote by s(n, 2) the minimum number such that, for each graph G of order n, we have rvc(G) 2provided |E(G)|≥s(n, 2). It is proved that s(n, 2) = n-22 + 2. Next, we characterize the vertex rainbow connection numbers of graphs G with |V(G)| = n, diam(G)≥3 and clique number ω(G) = n- s for 1≤s≤4.     

Distance Integral Complete Multipartite Graphs with s=5, 6

Let D(G) = (dij )n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vertices vi and vj in G. A graph is called distance integral if all eigenvalues of its distance matrix are integers. In 2014, Yang and Wang gave a su?cient and necessary condition for complete r-partite graphs Kp1,p2,··· ,pr =Ka1·p1,a2·p2,··· ,as···ps to be distance integral and obtained such distance integral graphs with s = 1, 2, 3, 4. However distance integral complete multipartite graphs Ka1·p1,a2·p2,··· ,as·ps with s>4 have not been found. In this paper, we find and construct some infinite classes of these distance integral graphs Ka1·p1,a2·p2,··· ,as·ps with s = 5, 6. The problem of the existence of such distance integral graphs Ka1·p1,a2·p2,··· ,as·ps with arbitrarily large number s remains open.     

On the Hosoya index of graphs

Let G be a (molecular) graph. The Hosoya index Z(G) of G is defined as the number of subsets of the edge set E(G) in which no two edges are adjacent in G, i.e., Z(G) is the total number of matchings of G. In this paper, we determine all the connected graphs G with n + 1 ≤ Z(G) ≤ 5n ? 17 for n ≥ 19. As a byproduct, the graphs of n vertices with Hosoya index from the second smallest value to the twenty first smallest value are obtained for n ≥ 19.     

含有割点的图的最小特征值

Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,where ψn denotes the set of connected graphs of order n with cut vertices.     

单圈图的极小能量

For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let Undenote the set of all connected unicyclic graphs with order n, and Ur n= {G ∈ Un| d(x) = r for any vertex x ∈ V(Cl)}, where r ≥ 2 and Cl is the unique cycle in G. Every unicyclic graph in Ur nis said to be a cycle-r-regular graph.In this paper, we completely characterize that C39(2, 2, 2) ο Sn-8is the unique graph having minimal energy in U4 n. Moreover, the graph with minimal energy is uniquely determined in Ur nfor r = 3, 4.     

Least Common Multiple of Path, Star with Cartesian Product of Some Graphs

A graph G without isolated vertices is a least common multiple of two graphs H₁ and H₂ if G is a smallest graph,in terms of number of edges,such that there exists a decomposition of G into edge disjoint copies of H₁ and H₂.The collection of all least common multiples of H₁ and H₂ is denoted by LCM(H₁,H₂) and the size of a least common multiple of H₁ and H₂ is denoted by lcm(H₁...     

单圈图的最大特征值的上界的改进

Let G（V, E） be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V（Cm）. The G - E（Cm） are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui ： i = 1, 2 , m}. Let κ = ec＋1. Forj = 1,2,...,k- 1, let δij = max{dv ： dist（v, ui） = j,v ∈ Ti}, δj = max{δij ： i = 1, 2,..., m}, δ0 = max{dui ： ui ∈ V（Cm）}. Then λ1（G）≤max{max 2≤j≤k-2 （√δj-1-1＋√δj-1）,2＋√δ0-2,√δ0-2＋√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 （G） is the largest eigenvalue of the adjacency matrix of G.     

图的p-Sombor(拉普拉斯)矩阵的谱性质

最近在化学图论引入的Sombor指数可以预测分子的物理化学性质. 本文从代数的角度来研究($p$-)Sombor指数的性质. $p$-Sombor矩阵$\mathcal{S}_{p}(G)$是一个$n$阶方阵, 当$v_{i}\sim v_{j}$时, 其$(i,j)$位置的元素为$((d_{i})^{p}+(d_{j})^{p})^{\frac{1}{p}}$, 否则为$0$, 其中$d_{i}$表示图$G$中顶点$v_{i}$的度. 该矩阵推广了著名的Zagreb矩阵$(p=1)$、Sombor矩阵$(p=2)$和inverse sum indeg矩阵$(p=-1)$. 本文找到了一对$p$-Sombor非同谱的等能量图, 并确定了$p$-Sombor(拉普拉斯)谱半径的一些界. 然后刻画了具有$k$个不同$p$-Sombor拉普拉斯特征值的连通图的性质. 最后确定了一些特殊图的Sombor谱. 作为推论, 确定了Sombor矩阵$(p=2)$, Zagreb矩阵$(p=1)$和inverse sum indeg矩阵$(p=-1)$的谱性质.     

ON THE DIOPHANUNE EQUATION $\[\sum\limits_{i = 0}^N {\frac{{{x_i}}}{{{d_i}}}} \equiv 0\]$ (mod 1) AND ITS APPLICATIONS

The number $\[A({d_1}, \cdots ,{d_n})\]$ of solutions of the equation $$\[\sum\limits_{i = 0}^n {\frac{{{x_i}}}{{{d_i}}}} \equiv 0(\bmod 1),0 < {x_i} < {d_i}(i = 1,2, \cdots ,n)\]$$ where all the $\[{d_i}s\]$ are positive integers, is of significance in the estimation of the number $\[N({d_1}, \cdots {d_n})\]$ of solutiohs in a finite field $\[{F_q}\]$ of the equation $$\[\sum\limits_{i = 1}^n {{a_i}x_i^{{d_i}}} = 0,{x_i} \in {F_q}(i = 1,2, \cdots ,n)\]$$ where all the $\[a_i^''s\]$ belong to $\[F_q^*\]$. the multiplication group of $\[F_q^{[1,2]}\]$. In this paper, applying the inclusion-exclusion principle, a greneral formula to compute $\[A({d_1}, \cdots ,{d_n})\]$ is obtained. For some special cases more convenient formulas for $\[A({d_1}, \cdots ,{d_n})\]$ are also given, for example, if $\[{d_i}|{d_{i + 1}},i = 1, \cdots ,n - 1\]$, then $$\[A({d_1}, \cdots ,{d_n}) = ({d_{n - 1}} - 1) \cdots ({d_1} - 1) - ({d_{n - 2}} - 1) \cdots ({d_1} - 1) + \cdots + {( - 1)^n}({d_2} - 1)({d_1} - 1) + {( - 1)^n}({d_1} - 1).\]$$     

关于三圈图的拉普拉斯谱半径的一些结果

边数等于点数加二的连通图称为三圈图.~设 ~$\Delta(G)$~和~$\mu(G)$~
分别表示图~$G$~的最大度和其拉普拉斯谱半径,设${\mathcal
T}(n)$~表示所有~$n$~阶三圈图的集合,证明了对于~${\mathcal
T}(n)$~的两个图~$H_{1}$~和~$H_{2}$~,~若~$\Delta(H_{1})>
\Delta(H_{2})$ ~且 ~$\Delta(H_{1})\geq \frac{n+7}{2}$,~则~$\mu
(H_{1})> \mu (H_{2}).$ 作为该结论的应用,~确定了~${\mathcal
T}(n)(n\geq9)$~中图的第七大至第十九大的拉普拉斯谱半径及其相应的极图.     

关于乘积Sombor指数的极值(分子)树

拓扑指数是一类可以用来预测化合物的物理化学性质的数值不变量, 其并被广泛用于量子化学、分子生物学和其他研究领域. 对于一个顶点集为$V(G)$、边集为$E(G)$的(分子)图$G$, 其Sombor指数定义为$SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{G}^{2}(u)+d_{G}^{2}(v)}$, 其中$d_{G}(u)$表示顶点$u$在$G$中的度. 相应地, 乘积Sombor指数定义为$\prod\nolimits_{SO}(G)= \prod\limits_{uv\in E(G)}\sqrt{d_{G}^{2}(u)+d_{G}^{2}(v)}$. 分子树是最大度$\Delta\leq 4$的树. 在本文中, 我们首先确定了乘积Sombor指数最大的分子树, 然后我们确定了乘积Sombor指数的前十三小的(分子)树.     

一类上三角矩阵环$W_{n}(p, q)$的斜Armendariz性质

设α是环R的一个自同态,称环R是α-斜Armendariz环,如果在R[x;α]中,(∑_(i=0)~ma_ix~i)(∑_(j=0)~nb_jx~j)=0,那么a_ia~i(b_j)=0,其中0≤i≤m,0≤j≤n.设R是α-rigid环,则R上的上三角矩阵环的子环W_n(p,q)是α~—-斜Armendariz环.     

The Majorization Theorem for Signless Laplacian Spectral Radii of Connected Graphs

Let ${\pi=(d_{1},d_{2},\ldots,d_{n})}$ and ${\pi'=(d'_{1},d'_{2},\ldots,d'_{n})}$ be two non-increasing degree sequences. We say ${\pi}$ is majorizated by ${\pi'}$ , denoted by ${\pi \vartriangleleft \pi'}$ , if and only if ${\pi\neq \pi'}$ , ${\sum_{i=1}^{n}d_{i}=\sum_{i=1}^{n}d'_{i}}$ , and ${\sum_{i=1}^{j}d_{i}\leq\sum_{i=1}^{j}d'_{i}}$ for all ${j=1,2,\ldots,n}$ . If there exists one connected graph G with ${\pi}$ as its degree sequence and ${c=(\sum_{i=1}^{n}d_{i})/2-n+1}$ , then G is called a c-cyclic graph and ${\pi}$ is called a c-cyclic degree sequence. Suppose ${\pi}$ is a non-increasing c-cyclic degree sequence and ${\pi'}$ is a non-increasing graphic degree sequence, if ${\pi \vartriangleleft \pi'}$ and there exists some t ${(2\leq t\leq n)}$ such that ${d'_{t}\geq c+1}$ and ${d_{i}=d'_{i}}$ for all ${t+1\leq i\leq n}$ , then the majorization ${\pi \vartriangleleft \pi'}$ is called a normal majorization. Let μ(G) be the signless Laplacian spectral radius, i.e., the largest eigenvalue of the signless Laplacian matrix of G. We use C _π to denote the class of connected graphs with degree sequence π. If ${G \in C_{\pi}}$ and ${\mu(G)\geq \mu(G')}$ for any other ${G'\in C_{\pi}}$ , then we say G has greatest signless Laplacian radius in C _π . In this paper, we prove that: Let π and π′ be two different non-increasing c-cyclic (c ≥ 0) degree sequences, G and G′ be the connected c-cyclic graphs with greatest signless Laplacian spectral radii in C _π and C _π', respectively. If ${\pi \vartriangleleft \pi'}$ and it is a normal majorization, then ${\mu(G) < \mu(G')}$ . This result extends the main result of Zhang (Discrete Math 308:3143–3150, 2008).     

boundedness of discrete singular Radon transforms

We prove that if is a Calderón-Zygmund kernel and is a polynomial of degree with real coefficients, then the discrete singular Radon transform operator

extends to a bounded operator on , . This gives a positive answer to an earlier conjecture of E. M. Stein and S. Wainger.

     

沿着不连通曲面的Heegaard分解的不可稳定化的融合积

Let M be a 3-manifold, F= {F1 , F2 , . . . , Fn } be a collection of essential closed surfaces in M (for any i, j ∈ {1, ..., n}, ifi≠j, Fi is not parallel to Fj and Fi ∩Fj = φ) and0 M be a collection of components of M. Suppose M-UFi ∈FFi×(-1, 1) contains k components M1 , M2 , . . . , Mk . If each M i has a Heegaard splitting ViUSiWi with d(Si) > 4(g(M1 ) + ··· + g(Mk )), then any minimal Heegaard splitting of M relative to 0M is obtained by doing amalgamations and self-amalgamations from minimal Heegaard splittings or -stabilization of minimal Heegaard splittings of M1 , M2 , . . . , Mk .