一些定向图的斜秩

设G~σ为一个定向图,S(G~σ)为它的斜邻接矩阵.定向图G~σ的斜秩定义为S(G~σ)的秩,记为sr(G~σ).本文刻画了一些定向图以及一类k-圈定向图的斜秩.     

定向图的斜Randic能量

图G是一个简单无向图,G~σ是图G在定向σ下的定向图,G被称作G~σ的基础图.定向图G~σ的斜Randi6矩阵是实对称n×n矩阵R_s(G~σ)=[(r_s)_(ij)].如果(v_i,v_j)是G~σ的弧,那么(r_s)_(ij)=(d_id_j)~(-1/2)且(r_s)_(ji)=(d_id_j)~(-1/2),否则(r_s)_(ij)=(r_s)_(ji)=0.定向图G~σ的斜Randi能量RE_s(G~σ)是指R_s(G~σ)的所有特征值的绝对值的和.首先刻画了定向图G~σ的斜Randi矩阵R_s(G~σ)的特征多项式的系数.然后给出了定向图G~σ的斜Randi能量RE_s(G~σ)的积分表达式.之后给出了RE_s(G~σ)的上界.最后计算了定向圈的斜Randi能量RE_s(G~σ).     

含有多个圈的图的秩

研究了含有多个圈的图的邻接矩阵的秩.将k(k≥2)条点不交的路,首和尾分别粘合得到的图称为Θ-图.用Γ(k-1)表示含有Θ-图作为导出子图的(k-1)-圈图的集合,而用C(η,k)表示含有n个顶点和k个边不交的圈的图的集合.确定了Γ(k-1)中秩等于5和6的图以及C(n,k)中秩等于4,5和6的图.     

给定阶数的简约单圈图的秩集(英文)

图的秩定义为其邻接阵的秩.如果一个连通图中不同顶点的邻域是不同的,我们称该图是简约图.本文证明有n个顶点简约单圈图的秩r满足:若r是偶数,则2n/3≤r≤n;若r是奇数,则(2n+5)/3≤r≤n.同时我们给出有偶数秩r和阶数3r/2或奇数秩r和阶数(3r-5)/2极大简约单圈图的刻画.     

基于次序秩的非参数EWMA联合控制图

本文提供了一个基于次序秩的非参数EWMA联合控制图(DNE)用于监测位置参数的持续性漂移.这是一个自启动控制图,不用累积大量可控样本数据,可以用于监控开始阶段。同时,我们不需要预先知道样本的分布,也不需要预先调整任何参数.通过数据模拟研究显示出这个控制图不仅在各种不同分布下具有很好的稳健性,并且对各种大小的漂移都很有效。文章最后通过工业上一个真实例子表明,这个控制图在实际应用中有着非常好的表现。     

树和单圈图的斜谱矩

给定图$G$,对图$G$的每条边确定一个方向,称为$G$的定向图$G^\sigma$, $G$称为$G^\sigma$的基础图. $G^\sigma$的斜邻接矩阵$S(G^\sigma)$是反对称矩阵,其特征值是0或纯虚数. $S(G^\sigma)$所有特征值的$k$次幂之和称为$G^\sigma$的$k$阶斜谱矩,其中$k$是非负整数.斜谱矩序列可用于对图进行排序.本文主要研究定向树和定向单圈图的斜谱矩,并对这两类图的斜谱矩序列依照字典序进行排序.首先确定了直径为$d$的树作为基础图的所有定向树中,斜谱矩序最大的$2\lfloor\frac{d}{4}\rfloor$个图; 然后确定以围长为$g$的单圈图作为基础图的所有定向单圈图中, 斜谱矩序最大的$2\lfloor\frac{g}{4}\rfloor+1$个图.     

不含偶圈双圈图的极小斜能量

令G为简单连通图. 给图G的每条边赋予一个方向, 得到的有向图, 记为G^\sigma. 有向图G^\sigma的斜能量E_{s}(G^{\sigma})定义为G^\sigma的斜邻接矩阵特征值的绝对值之和. 令\mathcal{B}^\circ_{n}表示顶点个数为n不含偶圈的双圈图的集合. 考虑了\mathcal{B}^\circ_{n}中图依斜能量从小到大的排序问题. 利用有向图斜能量的积分公式和实分析的方法, 当n \geq 156和155 \geq n\geq 12时, 分别得到了\mathcal{B}^\circ_{n}中具有最小、次二小和次三小斜能量的双圈图.     

准传递定向图上的Seymour点

有向图D是准传递的,如果对D中任意三个不同的顶点x, y和z,只要在D中存在弧xy, yz, x和z之间就至少存在一条弧. Seymour二次邻域猜想为:在任何一个定向图D中都存在一个顶点x,满足d_D⁺(x)d_D⁺⁺(x).这里,定向图是指没有2圈的有向图.称满足Seymour二次邻域猜想的点为Seymour点. Fisher证明了Seymour二次邻域猜想适用于竞赛图,也就是每个竞赛图至少包含一个Seymour点. Havet和Thomassé证明了,无出度为零的点的竞赛图至少包含两个Seymour点.注意到,竞赛图是准传递有向图的子图类.研究Seymour二次邻域猜想在准传递定向图上的正确性,通过研究准传递定向图与扩张竞赛图的Seymour点之间的关系,证明了准传递定向图上Seymour二次邻域猜想的正确性,得到:每个准传递定向图至少包含一个Seymour点;无出度为零的点的准传递定向图至少包含两个Seymour点.     

图的特征多项式的若干性质

图的特征多项式有许多性质，本文给出了特征多项式的指数表达式，特征多项式的导数的几个不同表达式以及高阶导数的图论意义。     

简单图的一种计数方法

对某一类图的邻接矩阵进行分类 ,从而给出这类图的一种计数方法 ,并且这种方法比较原来的Polya方法更为可行 .     

On the oriented chromatic index of oriented graphs

A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that is an arc in H whenever is an arc in G. The oriented chromatic index of an oriented graph G is the minimum number of vertices in an oriented graph H such that there exists a homomorphism from the line digraph LD(G) of G to H (the line digraph LD(G) of G is given by V(LD(G)) = A(G) and whenever and ). We give upper bounds for the oriented chromatic index of graphs with bounded acyclic chromatic number, of planar graphs and of graphs with bounded degree. We also consider lower and upper bounds of oriented chromatic number in terms of oriented chromatic index. We finally prove that the problem of deciding whether an oriented graph has oriented chromatic index at most k is polynomial time solvable if k ≤ 3 and is NP‐complete if k ≥ 4. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 313–332, 2008     

A note on vertex pancyclic oriented graphs

Let D be an oriented graph of order n ≥ 9, minimum degree at least n − 2, such that, for the choice of distinct vertices x and y, either xy ∈ E(D) or d⁺(x) + d⁻(y) ≥ n − 3. Song (J. Graph Theory 18 (1994), 461–468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also generalizes a result of Jackson (J. Graph Theory 5 (1981), 147–157) for the existence of a hamiltonian cycle in oriented graphs. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 313–318, 1999     

Homomorphism bounds for oriented planar graphs

If is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a homomorphism bound for if there is a homomorphism from each graph in to H. We find some necessary conditions for a graph to be a homomorphism bound for the class of oriented planar graphs and prove that such a graph must have maximum degree at least 16; thus there exists an oriented planar graph with oriented chromatic number at least 17. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 175–190, 2007     

On imbalances in oriented tripartite graphs

An oriented tripartite graph is the result of assigning a direction to each edge of a simple tripartite graph. For any vertex x in an oriented tripartite graph D(U,V,W), let d _x ⁺ and d _x ⁻ denote the outdegree and indegree respectively of x. Define $ a_{u_i } = d_{u_i }^ + - d_{u_i }^ - , b_{v_j } = d_{v_j }^ + - d_{v_j }^ - $ a_{u_i } = d_{u_i }^ + - d_{u_i }^ - , b_{v_j } = d_{v_j }^ + - d_{v_j }^ - and $ c_{w_k } = d_{w_k }^ + - d_{w_k }^ - $ c_{w_k } = d_{w_k }^ + - d_{w_k }^ - as the imbalances of the vertices u _i in U, v _j in V and w _k in W respectively. In this paper, we obtain criteria for sequences of integers to be the imbalances of some oriented tripartite graph.     

Kings and serfs in oriented graphs

In this paper, we extend the concept of kings and serfs in tournaments to that of weak kings and weak serfs in oriented graphs. We obtain various results on the existence of weak kings (weak serfs) in oriented graphs, and show the existence of n-oriented graphs containing exactly k weak kings (weak serfs), 1 ≤ k ≤ n. Also, we give the existence of n-oriented graphs containing exactly k weak kings and exactly s weak serfs such that b weak kings from k are also weak serfs.      

Completing orientations of partially oriented graphs

We initiate a general study of what we call orientation completion problems. For a fixed class of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in by orienting the (nonoriented) edges in P. Orientation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, including k‐arc‐strong oriented graphs, k‐strong oriented graphs, quasi‐transitive‐oriented graphs, local tournaments, acyclic local tournaments, locally transitive tournaments, locally transitive local tournaments, in‐tournaments, and oriented graphs that have directed cycle factors. We show that the orientation completion problem for each of these classes is either polynomial time solvable or NP‐complete. We also show that some of the NP‐complete problems become polynomial time solvable when the input‐oriented graphs satisfy certain extra conditions. Our results imply that the representation extension problems for proper interval graphs and for proper circular arc graphs are polynomial time solvable. The latter generalizes a previous result.     

The chromatic number of oriented graphs

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with bounded degree. We show that there exist oriented k-trees with chromatic number at least 2^k+1 - 1 and that every oriented k-tree has chromatic number at most (k + 1) × 2^k. For 2-trees and 3-trees we decrease these upper bounds respectively to 7 and 16 and show that these new bounds are tight. As a particular case, we obtain that oriented outerplanar graphs have chromatic number at most 7 and that this bound is tight too. We then show that every oriented graph with maximum degree k has chromatic number at most (2k - 1) × 2^2k-2. For oriented graphs with maximum degree 2 we decrease this bound to 5 and show that this new bound is tight. For oriented graphs with maximum degree 3 we decrease this bound to 16 and conjecture that there exists no such connected graph with chromatic number greater than 7. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 191–205, 1997     

Score sets in oriented 3-partite graphs

Let D(U, V, W) be an oriented 3-partite graph with |U|=p, |V|=q and |W|= r. For any vertex x in D(U, V, W), let d x and d-x be the outdegree and indegree of x respectively. Define aui (or simply ai) = q r d ui - d-ui, bvj(or simply bj) = p r d vj - d-vj and Cwk (or simply ck) = p q d wk - d-wk as the scores of ui in U, vj in V and wk in Wrespectively. The set A of distinct scores of the vertices of D(U, V, W) is called its score set. In this paper, we prove that if a1 is a non-negative integer, ai(2≤i≤n - 1) are even positive integers and an is any positive integer, then for n≥3, there exists an oriented 3-partite graph with the score set A = {a1,2∑i=1 ai,…,n∑i=1 ai}, except when A = {0,2,3}. Some more results for score sets in oriented 3-partite graphs are obtained.     

有向图反能量的一个注记

有向图的反能量是指有向图的反邻接矩阵的能量.本文利用有向图的运算构造出了几类有向图,它们中的每一个都满足有向图的反能量等于其底图的能量.部分回答了Adiga等人在文[The skew energy of a digraph,Linear Algebra Appl.,2010,432:1825-1835]中提出的一个公开问题.