排序方式: 共有17条查询结果,搜索用时 220 毫秒
1.
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度. 相似文献
2.
本文给出了一个图为Menger型的一个充分必要条件,利用这个条件,我们拓广了已知的Menger型图的类。 相似文献
3.
本文引入了两类具有六个同构块的苯系异构物,每类包含八个本质不同的异物构物,我们能够依据于它们所含克勒结构数目对这八个异构物勒结构数目对这八个异构物进行全序比较。 相似文献
4.
设G是一个简单图,若分离G的任一独立集S的最小点数等于连接S的点之间的内部不相交路的最大个数,则称G是Menger型图,本文讨论了几类Menger型图。 相似文献
5.
Let G be a connected graph. For ${x,y\in V(G)}$ with d(x, y) = 2, we define ${J(x,y)= \{u \in N(x)\cap N(y)\mid N[u] \subseteq N[x] \,{\cup}\,N[y] \}}$ and ${J'(x,y)= \{u \in N(x) \cap N(y)\,{\mid}\,{\rm if}\ v \in N(u){\setminus}(N[x] \,{\cup}\, N[y])\ {\rm then}\ N[x] \,{\cup}\, N[y]\,{\cup}\,N[u]{\setminus}\{x,y\}\subseteq N[v]\}}$ . A graph G is quasi-claw-free if ${J(x,y) \not= \emptyset}$ for each pair (x, y) of vertices at distance 2 in G. Broersma and Vumar (in Math Meth Oper Res. doi:10.1007/s00186-008-0260-7) introduced ${\mathcal{P}_{3}}$ -dominated graphs defined as ${J(x,y)\,{\cup}\, J'(x,y)\not= \emptyset}$ for each ${x,y \in V(G)}$ with d(x, y) = 2. This class properly contains that of quasi-claw-free graphs, and hence that of claw-free graphs. In this note, we prove that a 2-connected ${\mathcal{P}_3}$ -dominated graph is 1-tough, with two exceptions: K 2,3 and K 1,1,3, and prove that every even connected ${\mathcal{P}_3}$ -dominated graph ${G\ncong K_{1,3}}$ has a perfect matching. Moreover, we show that every even (2p + 1)-connected ${\mathcal{P}_3}$ -dominated graph is p-extendable. This result follows from a stronger result concerning factor-criticality of ${\mathcal{P}_3}$ -dominated graphs. 相似文献
6.
本文研究了围长为6的K_4同胚图的色性,对于其中的非色唯一图,给出了其色类。 相似文献
7.
设C是k-连通图G(2≤k≤6)的一个最长圈.H是G-C的一个分支.[5]中证明,若L(H)≥k-2,则|C|≥kδ-k(k-2),这里L(H)表示H中最长路的长度,δ表示G的最小度.本文在H满足特定的条件时,对于k∈{3,4,5}改进了上述|C|的度下界. 相似文献
8.
Let G be a connected graph. For at distance 2, we define , and , if then . G is quasi-claw-free if it satisfies , and G is P
3-dominated() if it satisfies , for every pair (x, y) of vertices at distance 2. Certainly contains as a subclass. In this paper, we prove that the circumference of a 2-connected P
3-dominated graph G on n vertices is at least min or , moreover if then G is hamiltonian or , where is a class of 2-connected nonhamiltonian graphs. 相似文献
9.
图G=(V,E)的Wiener极性指数定义为G中距离为3的无序点对的个数.文中给出了广义hierarchical积图、笛卡尔积图及F-和图的Wiener极性指数运算公式.同时也给出了两个图的Kronecker积图和复合图的Wiener极性指数运算公式. 相似文献
10.