符号圈拼接图的零度

令$\eta(\Gamma)$和$c(\Gamma)$是符号图$\Gamma$的零度和基本圈数. 一个符号圈拼接图是指每个块都是圈的连通符号图. 本文证明了对任意符号拼接图$\eta(\Gamma)\le c(\Gamma)+1$成立, 并且刻画了等号成立的极图, 推广了王登银等人(2022)在简单圈拼接图上的结果. 此外, 我们证明了任意的符号拼接图$\eta(\Gamma)\neq c(\Gamma)$, 给出了满足$\eta(\Gamma)=c(\Gamma)-1$的符号拼接图的一些性质并刻画处$\eta(\Gamma)=c(\Gamma)-1$的二部符号拼接图.     

距离正则图的推广

本文研究了直径为d(Γ) ≥ 2的距离正则图Γ的补图.利用Γ的交叉数分别证明了当d=2时,Γ的补图式强正则;当d ≥ 3时,Γ的补图是广义强正则.将文献[2]中的距离正则图Grassmann图、对偶极图、Hamming图推广到它们的补图,从而得到广义强正则图.     

有限赋值AR-箭图导出的Lie代数

设Γ是连通赋值AR-箭图,用￡(Γ)=_x∈Γ0Zu_x表示由Γ的顶点集Γ₀生成的自由Abel群,^~Γ为Γ的泛覆盖,基本群为G,证明了当Γ是有限连通的赋值AR-箭图时,￡(Γ)关于括号运算作成(Γ)₁的Lie子代数且￡(Γ)/G (Γ)。这里 (Γ)₁是Γ的退化Hall代数,(^~Γ)/G是由^~Γ导出的轨道Lie代数。     

形变预投射代数与量子群的表示

设$(\Gamma, I)$是约束循环箭图, 其顶点对应于Abel群$\Z_d$. 给出了所有 $(\Gamma, I)$的不可分解表示以及其中可扩张成相应形变预投射代数 $\Pi^\lambda(\Gamma, I)$的不可分解表示的条件. 证明了由$(\Gamma, I)$的 可扩张不可分解表示提升得到的$\Pi^\lambda(\Gamma, I)$的表示一定是其 所有单表示, 从而通过形变预投射代数的方式实现了限制量子群 $\ol{U}_q({\rm sl}_2)$的所有单表示.     

信噪比的分解及其在稳健设计中的应用

本文讨论了信噪比的分解及其在稳健设计中的应用, 引用PerMIA的概念给出了田口的信噪比和社会平均二次损失联系\bd 最后将97年中国大学生数学建模的赛题作为算例, 其参数设计的优化过程更为简洁.     

基于Gamma桥抽样的机械设备退化失效过程仿真方法研究

针对机械设备退化失效分析过程中的随机假设的有效性问题,提出了一类基于Gamma桥抽样的仿真验证方法.通过实例分析,比较某型发动机的实际铁谱分析数据与Gamma过程仿真所得的退化轨道,证明了Gamma过程描述单调退化过程变化规律的有效性.     

Gamma分布环境因子的统计分析

证明了Gamma分布环境因子的最大似然估计是有偏估计,且其偏差为正,进而导出了Gamma分布环境因子的近似无偏估计.利用Cornish-Fisher展开导出了Gamma分布环境因子的广义置信区间,另外也给了Gamma分布环境因子的Bootstrap-t置信区间.利用模拟方法研究了所给近似无偏估计和区间估计的精度,模拟结果显示所给近似无偏估计和区间估计的精度是相当好的.     

Gamma恒定应力加速寿命试验的统计分析

证明了基于恒定应力加速寿命试验数据Gamma模型参数的最大似然估计在一定条件下存在,进而导出了Gamma模型参数的备择估计.利用Cornish-Fisher展开导出了Gamma形状参数的近似置信区间,另外也给了Gamma模型的其它参数和正常应力水平下产品寿命的一些重要可靠性指标的广义置信区间.利用模拟方法研究了所给点估计和区间估计的精度,模拟结果显示所给点估计和区间估计的精度是相当好的.     

利用Gamma函数求积分的几种形式

借助幂函数与对数函数的变量替换对Gamma函数从形式上加以推广,使Gamma函数中指数函数部分为指数函数与幂函数或对数函数与幂函数的复合函数时仍可求值,以扩大Gamma函数的使用范围.     

W1,p(Ω)空间中非强制变分问题的Γ-收敛

本文研究了泛函在向量值Sobolev空间中关于其弱拓扑的Γ-收敛问题。通过灵活地结合研究Γ-收敛的各种不同方法,构造出一种新型的表达式,克服了f(y,λ)不满足强制性条件的困难。     

Fitting heights and the character degree graph

We say that the degree graph G\Gamma has bounded Fitting height if there is a bound on the Fitting heights of the solvable groups for which G\Gamma is the degree graph. In this paper, we determine which degree graphs have bounded Fitting height.     

A Computer-Assisted Proof of the Uniqueness of the Perkel Graph

The Perkel graph is a distance-regular graph of order 57, degree 6 and diameter 3, with intersection array (6, 5, 2; 1, 1, 3). We describe a computer assisted proof that every graph with this intersection array is isomorphic to the Perkel graph. The computer proof relies heavily on the fact that the minimal idempotents for , and their submatrices, are positive semidefinite.To minimize the risk of computer errors we have used two different methods to establish the same theorem and as an added precaution large parts of the corresponding programs were written by different authors.The first method generates plausible subgraphs induced by all vertices at distance 3 from a fixed vertex of and then tries to extend each of the generated graphs to a full graph with the given intersection array.The second method generates possible neighborhoods for a pentagon in . It turns out that every such pentagon can be extended to a Petersen graph in . We then prove mathematically that there is, up to isomorphism, only a single graph with this property.     

Certain graphs with exactly one irreducible T-module with endpoint 1, which is thin

Journal of Algebraic Combinatorics - Let $$\Gamma $$ denote a finite, simple and connected graph. Fix a vertex x of $$\Gamma $$ and let $$T=T(x)$$ denote the Terwilliger algebra of $$\Gamma $$ with...     

Comparison of graphs associated to a commutative Artinian ring

Let R be a commutative ring with \(1\ne 0\) and the additive group \(R^+\). Several graphs on R have been introduced by many authors, among zero-divisor graph \(\Gamma _1(R)\), co-maximal graph \(\Gamma _2(R)\), annihilator graph AG(R), total graph \( T(\Gamma (R))\), cozero-divisors graph \(\Gamma _\mathrm{c}(R)\), equivalence classes graph \(\Gamma _\mathrm{E}(R)\) and the Cayley graph \(\mathrm{Cay}(R^+ ,Z^*(R))\). Shekarriz et al. (J. Commun. Algebra, 40 (2012) 2798–2807) gave some conditions under which total graph is isomorphic to \(\mathrm{Cay}(R^+ ,Z^*(R))\). Badawi (J. Commun. Algebra, 42 (2014) 108–121) showed that when R is a reduced ring, the annihilator graph is identical to the zero-divisor graph if and only if R has exactly two minimal prime ideals. The purpose of this paper is comparison of graphs associated to a commutative Artinian ring. Among the results, we prove that for a commutative finite ring R with \(|\mathrm{Max}(R)|=n \ge 3\), \( \Gamma _1(R) \simeq \Gamma _2(R)\) if and only if \(R\simeq \mathbb {Z}^n_2\); if and only if \(\Gamma _1(R) \simeq \Gamma _\mathrm{E}(R)\). Also the annihilator graph is identical to the cozero-divisor graph if and only if R is a Frobenius ring.     

Smallest graphs with given automorphism group

Journal of Algebraic Combinatorics - For a finite group G, denote by $$\alpha (G)$$ the minimum number of vertices of any graph $$\Gamma $$ having $$\mathrm {Aut}(\Gamma )\cong G$$ . In this paper,...     

The spectral excess theorem for distance-regular graphs having distance-<Emphasis Type="Italic">d</Emphasis> graph with fewer distinct eigenvalues

Let \(\Gamma \) be a distance-regular graph with diameter d and Kneser graph \(K=\Gamma _d\), the distance-d graph of \(\Gamma \). We say that \(\Gamma \) is partially antipodal when K has fewer distinct eigenvalues than \(\Gamma \). In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues) and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue). We provide a characterization of partially antipodal distance-regular graphs (among regular graphs with \(d+1\) distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance d from every vertex. This can be seen as a more general version of the so-called spectral excess theorem, which allows us to characterize those distance-regular graphs which are half-antipodal, antipodal, bipartite, or with Kneser graph being strongly regular.     

Lambda number of the power graph of a finite group

Journal of Algebraic Combinatorics - The power graph $$\Gamma _G$$ of a finite group G is the graph with the vertex set G, where two distinct elements are adjacent if and only if one is a power of...     

{Omega}-Covers of Graphs

Given a group G, a G-set and a graph we present a constructionfor a family of graphs, the -covers of . A particular exampleof this construction gives a girth 17 cubic graph with 2530vertices. 2000 Mathematics Subject Classification 05C25, 05C35.     

Finite 2-Geodesic Transitive Abelian Cayley Graphs

In this paper, we first give a classification of the family of 2-geodesic transitive abelian Cayley graphs. Let \(\Gamma \) be such a graph which is not 2-arc transitive. It is shown that one of the following holds: (1) \(\Gamma \cong \mathrm{K}_{m[b]}\) for some \(m\ge 3\) and \(b\ge 2\); (2) \(\Gamma \) is a normal Cayley graph of an elementary abelian group; (3) \(\Gamma \) is a cover of Cayley graph \(\Gamma _K\) of an abelian group T / K, where either \(\Gamma _K\) is complete arc transitive or \(\Gamma _K\) is 2-geodesic transitive of girth 3, and A / K acts primitively on \(V(\Gamma _K)\) of type Affine or Product Action. Second, we completely determine the family of 2-geodesic transitive circulants.