半无爪可迹图的度和条件

可迹图即为一个含有Hamilton路的图.令$N[v]=N(v)\cup\{v\}$, $J(u,v)=\{w\in N(u)\cap N(v):N(w)\subseteq N[u]\cup N[v]\}$.若图中任意距离为2的两点$u,v$满足$J(u,v)\neq \emptyset$,则称该图为半无爪图.令$\sigma_{k}(G)=\min\{\sum_{v\in S}d(v):S$为$G$中含有$k$个点的独立集\},其中$d(v)$表示图$G$中顶点$v$的度.本论文证明了若图$G$为一个阶数为$n$的连通半无爪图,且$\sigma_{3}(G)\geq {n-2}$,则图$G$为可迹图; 文中给出一个图例,说明上述结果中的界是下确界; 此外,我们证明了若图$G$为一个阶数为$n$的连通半无爪图,且$\sigma_{2}(G)\geq \frac{2({n-2})}{3}$,则该图为可迹图.     

几乎无爪图的叶子数较少的生成树

A spanning tree with no more than 3 leaves is called a spanning 3-ended tree.In this paper, we prove that if G is a k-connected(k ≥ 2) almost claw-free graph of order n and σ_(k+3)(G) ≥ n + k + 2, then G contains a spanning 3-ended tree, where σk(G) =min{∑_(v∈S)deg(v) : S is an independent set of G with |S| = k}.     

无$K_{1,4}$子图的图的路覆盖

For a graph G, a path cover is a set of vertex disjoint paths covering all the vertices of G, and a path cover number of G, denoted by p(G), is the minimum number of paths in a path cover among all the path covers of G. In this paper, we prove that if G is a K_(1,4)-free graph of order n and σ_(k+1)(G) ≥ n-k, then p(G) ≤ k, where σ_(k+1)(G) = min{∑v∈S d(v) : S is an independent set of G with |S| = k + 1}.     

L7（3）与GL7（3）的OD-刻画

对于任意一个有限群G,令π（G）表示由它的阶的所有素因子构成的集合.构建一种与之相关的简单图,称之为素图,记作Γ（G）.该图的顶点集合是π（G）,图中两顶点p,g相连（记作p～q）的充要条件是群G恰有pq阶元.设π（G）={P₁,p2,…,p_x}.对于任意给定的p∈π（G）,令deg（p）:=|{q∈π（G）|在素图Γ（G）中,p～q}|,并称之为顶点p的度数.同时,定义D（G）:=（deg（p₁）,deg（p₂）,…,deg（p_s））,其中p₁2<…相似文献   

图的$A_\alpha$谱半径的注释

设$G$为具有$n$个顶点的简单图, $\rho_\alpha(G)$为其$A_\alpha(G)$谱半径.对图$G$的任一顶点$v_i$, 本文给出了$\rho_\alpha(G)$与$\rho_alpha(G-v_i)$之间的关系.     

单圈图的最大Balaban指数与最大和Balaban指数

The Balaban index of a connected graph G is defined as J(G) =|E(G)|μ + 1∑e=uv∈E(G)1√DG(u)DG(v),and the Sum-Balaban index is defined as SJ(G) =|E(G)|μ + 1∑e=uv∈E(G)1√DG(u)+DG(v),where DG(u) =∑w∈V(G)dG(u, w), and μ is the cyclomatic number of G. In this paper, the unicyclic graphs with the maximum Balaban index and the maximum Sum-Balaban index among all unicyclic graphs on n vertices are characterized, respectively.     

2-极大子群的$F_s$-拟正规性

$F$是一个群系. $G$的子群$H$在$G$中称为$F_s$-拟正规的,如果存在$G$的正规子群$T$,使得$HT$在$G$中是$s$-置换的并且$(H\cap T)H_G/H_G$包含在$G/H_G$的$F$超中心$Z^F_\infty(G/H_G)$中.本文利用$F_s$-拟正规子群研究了有限群的结构.获得了某些新的结果.     

Zeros of Monomial Brauer Characters

Let G be a finite group and p be a fixed prime. A p-Brauer character of G is said to be monomial if it is induced from a linear p-Brauer character of some subgroup(not necessarily proper) of G. Denote by IBr_m(G) the set of irreducible monomial p-Brauer′characters of G. Let H = G′O~p′(G) be the smallest normal subgroup such that G/H is an abelian p′-group. Suppose that g ∈ G is a p-regular element and the order of gH in the factor group G/H does not divide |IBr_m(G)|. Then there exists ? ∈ IBr_m(G) such that ?(g) = 0.     

环状硅酸盐图的友好指数集

Let G be a graph with vertex set V(G) and edge set E(G). A labeling f : V(G) →Z2 induces an edge labeling f*: E(G) → Z2 defined by f*(xy) = f(x) + f(y), for each edge xy ∈ E(G). For i ∈ Z2, let vf(i) = |{v ∈ V(G) : f(v) = i}| and ef(i) = |{e ∈ E(G) : f*(e) =i}|. A labeling f of a graph G is said to be friendly if |vf(0)- vf(1)| ≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as {|ef(0)- ef(1)|: the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS(n, m).     

On $\mathfrak{F}_\tau$-$s$-Supplemented Subgroups of Finite Groups

Let $\mathfrak{F}$ be a non-empty formation of groups, $\tau$ a subgroup functor and $H$ a $p$-subgroup of a finite group $G.$ Let $\overline{G}=G/H_G$ and $\overline{H} =H/H_G.$ We say that $H$ is $\mathfrak{F}_\tau$-$s$-supplemented in $G$ if for some subgroup $\overline{T}$ and some $\tau$-subgroup $\overline{S}$ of $\overline{G}$ contained in $\overline{H},$ $\overline{H}\overline{T}$ is subnormal in $\overline{G}$ and $\overline{H} ∩ \overline{T} ≤ \overline{S}Z_{\mathfrak{F}}(\overline{G}).$ In this paper, we investigate the influence of $\mathfrak{F}_\tau$-$s$-supplemented subgroups on the structure of finite groups. Some new characterizations about solubility of finite groups are obtained.     

单圈图的极小能量

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.     

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

边数等于点数加二的连通图称为三圈图.~设 ~$\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)$~中图的第七大至第十九大的拉普拉斯谱半径及其相应的极图.     

On Centralizer Subalgebras of Group Algebras

Let $G$ be a finite group, $H ≤ G$ and $R$ be a commutative ring with an identity $1_R$. Let $C_{RG}(H) = \{ α ∈ RG|αh= hα$ for all $h ∈ H \}$, which is called the centralizer subalgebra of $H$ in $RG$. Obviously, if $H = G$ then $C_{RG}(H)$ is just the central subalgebra $Z(RG)$ of $RG$. In this note, we show that the set of all $H$-conjugacy class sums of $G$ forms an $R$-basis of $C_{RG}(H)$. Furthermore, let $N$ be a normal subgroup of $G$ and $γ$ the natural epimorphism from $G$ to $\overline{G}= G/N$. Then $γ$ induces an epimorphism from $RG$ to $R\overline{G}$, also denoted by $γ$. We also show that if $R$ is a field of characteristic zero, then $γ$ induces an epimorphism from $C_{RG}(H)$ to $C_{R\overline{G}}(\overline{H})$, that is, $γ(C_{RG}(H)) = C_{R\overline{G}}(\overline{H})$.     

一个关于平面图的K-(2,1)-全可选性的结果

设图$G$的一个列表分配为映射$L: V(G)\bigcup E(G)\rightarrow2^{N}$. 如果存在函数$c$使得对任意$x\in V(G)\cup E(G)$有$c(x)\in L(x)$满足当$uv\in E(G)$时, $|c(u)-c(v)|\geq1$, 当边$e_{1}$和$e_{2}$相邻时, $|c(e_{1})-c(e_{2})|\geq1$, 当点$v$和边$e$相关联时, $|c(v)-c(e)|\geq 2$, 则称图$G$为$L$-$(p,1)$-全可标号的. 如果对于任意一个满足$|L(x)|=k,x\in V(G)\cup E(G)$的列表分配$L$来说, $G$都是$L$-$(2,1)$-全可标号的, 则称$G$是 $k$-(2,1)-全可选的. 我们称使得$G$为$k$-$(2,1)$-全可选的最小的$k$为$G$的$(2,1)$-全选择数, 记作$C_{2,1}^{T}(G)$. 本文, 我们证明了若$G$是一个$\Delta(G)\geq 11$的平面图, 则$C_{2,1}^{T}(G)\leq\Delta+4$.     

树的导出匹配覆盖

The induced matching cover number of a graph G without isolated vertices,denoted by imc(G),is the minimum integer k such that G has k induced matchings M1,M2,…,Mk such that,M1∪M2 ∪…∪Mk covers V(G).This paper shows if G is a nontrivial tree,then imc(G) ∈ {△*0(G),△*0(G) + 1,△*0(G)+2},where △*0(G) = max{d0(u) + d0(v) :u,v ∈ V(G),uv ∈ E(G)}.     

MULTIPLIERS OF SEGAL ALGEBRAS A_p(G)

Let G be a locally compact but non-compact abelian group,It is proved thatM(A_p(G),L_1(G))=M(G)and M(A_p(G),L_1(G)∩C_0(G))=M(L_1(G),L_1(G)∩C_0(G)).If G is discrete,then M(A_p(G),L_1(G))=A_p(G),M(A_p,(G),L_1(G)∩C_0(G))=A_p(G).     

关于双圈图的谱半径

如果G是连通的并且G的边数是n 1,那么n阶图G叫做双圈图,设B(n)是所有的阶为n的双圈图构成的集合,本文给出了B(n)(n(?)9)中前三大的邻接谱半径以及它们对应的图.     

笛卡尔乘积图的成对控制

Let γpr（G） denote the paired domination number and G □ H denote the Cartesian product of graphs G and H. In this paper we show that for all graphs G and H without isolated vertex, γpr（G）γpr（H）≤ 7γpr （G □H）.     

p-超循环嵌入子群的一个判别准则

令E是有限群G的一个正规子群,且U是所有有限超可解群的集合.E称为在G中是p-超循环嵌入的,如果E的每个pd-阶的G-主因子是循环的.G的子群H称为在G中是U-Φ-可补充的,如果存在G的一个次正规子群T,使得G=HT,且(H∩T)H_G/H_G≤Φ/(H/H_G)Z_U(G/H_G),其中Z_U(G/H_G)是商群G/H_G的U-超中心.作者证明,如果E的一些p-子群在G中是U-Φ-可补充的,那么E在G中是p-超循环嵌入的.作为应用,得到了有限群是p-超可解的若干判断准则,并且推广了一些已知的结果.     

Some new sequence spaces derived by The composition of binomial matrix and double band matrix

In this paper, we construct three new sequence spaces $b^{{r,s}}_{0}(G)$, $b^{{r,s}}_{c}(G)$ and $b^{{r,s}}_{\infty}(G)$ and mention some inclusion relations, where $G$ is generalized difference matrix. Moreover, we give Schauder basis of the spaces $b^{{r,s}}_{0}(G)$ and $b^{{r,s}}_{c}(G)$. Afterward, we determine $\alpha-$, $\beta-$ and $\gamma-$duals of those spaces. Finally, we characterize some matrix classes related to the space $b^{{r,s}}_{c}(G)$.