关于分数k-因子临界图与分数k-可扩图的若干结果

一个简单图G, 如果对于V(G)的任意k元子集S, 子图G-S都包含分数完美匹配, 那么称G为分数k-因子临界图. 如果图G的每个k-匹配M都包含在一个分数完美匹配中, 那么称图G为分数k-可扩图. 给出一个图是分数k-因子临界图和分数k-可扩图的充分条件, 并给出一个图是分数k-因子临界图的充分必要条件.     

有约束条件的图的分数k-因子

设G是一个简单的无向图，若G不是完全图，G的孤立韧度定义为I(G)=min{｜s｜／i(G-S)：S∈V(G)，i(G-S)≥2)；否则令I(G)=∞．对与图的孤立韧度I(G)密切相关的新参数，I’(G)，若G不是完全图，定义I’(G)=min{｜s｜/i(G-S)-1:S∈V(G)，i(G-S)≥2}；否则I’(G)=∞本文研究了新参数I‘(G)与图的分数κ-因子的关系，给出了具有某些约束条件的图的分数κ-因子存在的一些充分条件．     

图的韧度与分数k-因子的存在性

设G是一个简单无向图,若G不是完全图,G的韧度的一个变形定义为τ(G)=m in{S/(ω(G-S)-1)∶S V(G),ω(G-S)2}.否则,令τ(G)=∞.本文研究了参数τ(G)与分数k-因子的关系,给出了具有某些约束条件的图的分数k-因子存在的一些充分条件,并提出进一步可研究的问题.     

图的孤立韧度与分数k-覆盖图

设G是一个图,若对于图G的任一条边e,都存在一个分数k-因子h,使得h(e)=1,则称图G是分数k-覆盖图.图G的孤立韧度I(a)定义为:若G是完全图,则I(C)= ∞;否则,I(G)=min{|S|/i(G-S):SCV(G),i(G-S)≥2},其中i(G-S)表示G-S中的孤立点数目.本文首次提出并研究了一个图是分数k-覆盖图与它的孤立韧度之间的关系,证明了当I(G)>k,并且δ(G)>k 1时,G是分数k-覆盖图.我们还证明了,这个结果是最好可能的.     

图的分数因子与孤立韧度

图G的孤立韧度定义为I(G)=min{｜S｜/i(G-S)∶SV(G),i(G-S)≥2},若G不是完全图.否则令I(G)=∞.本文给出了图的分数k因子与图的分数[a,b]因子的存在性与图的孤立韧度的关系.证明了,若δ(G)≥k且I(G)≥k,则G有分数k因子;若δ(G)≥I(G)≥a-1 a/b,则图G有分数[a,b]因子,其中a相似文献   

图有分数因子的度条件

本文研究了图有分数因子的度条件,得到了下面的结果：令k(?)1是一个整数,G是一个连通的n阶图,n(?)4k-3且最小度δ(G)(?)k,若对于每一对不相邻的顶点u,v∈V(G)都有max{d_G(u),d_G(v)}(?)n/2,则G有分数k-因子．并指出该结果在一定意义上是最好可能的。     

图的联结数与分数k-消去图

设G是一个图,若对于图G的任一条边e,G-e都存在一个分数k-因子,则称G是一个分数κ-消去图.若k=2,则称分数κ-消去图为分数2-消去图.本文证明了当bind(G)≥2,并且6(G)≥3时,G是分数2-消去图.     

图的分数k-因子

给定图G=(V,E).设a和b是两个非负整数.fE→［0,1］是一个函数.如果     

关于图的孤立韧度与分数因子存在性的若干结果

本文讨论了图的孤立韧度I(G)以及与之相关的参数I^1(G)与图的分数因子存在性的关系，给出了I(G)及I^1(G)与图的分数点(边)消去性、分数L-可扩性及分数[1，b]-因子存在性之间关系的一系列结果．     

分数因子和分数哈密顿图

本文介绍了图的分数方面,将图中基于整数的定义和变量转化为分数形式．介绍了分数图论的一些新结果,特别是关于分数因子和分数哈密顿图的新结果,其中包括了作者最近得到的一些关于分数(g,f)-因子的若干结果．进而,提出了还没有解决的几个新问题．     

On the distribution of Laplacian eigenvalues of a graph

This paper presents some bounds on the number of Laplacian eigenvalues contained in various subintervals of [0, n] by using the matching number and edge covering number for G, and asserts that for a connected graph the Laplacian eigenvalue 1 appears with certain multiplicity. Furthermore, as an application of our result (Theorem 13), Grone and Merris’ conjecture [The Laplacian spectrum of graph II. SIAM J. Discrete Math., 7, 221–229 (1994)] is partially proved.     

Proof of a conjecture on fractional Ramsey numbers

Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function r_f (a₁, a₂, …, a_k) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case k=2. In this article, we answer an open problem by determining an explicit formula for the general case k>2 by constructing an infinite family of circulant graphs for which the independence numbers can be computed explicitly. This construction gives us two further results: a new (infinite) family of star extremal graphs which are a superset of many of the families currently known in the literature, and a broad generalization of known results on the chromatic number of integer distance graphs. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 164–178, 2010     

图的联结数与分数κ-消去图

设G是一个图,若对于图G的任一条边e,G-e都存在一个分数k-因子,则称G是一个分数k-消去图.若k=2,则称分数k-消去图为分数2-消去图.本文证明了当bind（G）≥2,并且δ（G）≥3时,G是分数2-消去图.     

A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory

We present a necessary and sufficient condition for an arbitrary matrix A to be totally unimodular. The matrix A is interpreted as the adjacency matrix of a bipartite graph G(A) The total unimodularity of A corresponds to non-existence of a cycle in G(A) which has an odd column valuation and which is equal to the induced subgraph, Some applications of the results are also discussed.     

On a stochastic fractional partial differential equation with a fractional noise

We will prove the existence, uniqueness and regularity of the solution for a stochastic fractional partial differential equation driven by an additive fractional space–time white noise. Moreover, the absolute continuity of the solution is also obtained.