期刊文献+
共找到7篇文章
< 1 >
每页显示 20 50 100
A Sufficient Condition for 2-Distance-Dominating Cycles
1
作者 Xinman Wang Linyu Li 《Engineering(科研)》 2022年第3期113-118,共6页
A cycle C of a graph G is a m-distance-dominating cycle if for all vertices of . Defining denotes the minimum value of the degree sum of any k independent vertices of G. In this paper, we prove that if G is a 3-connec... A cycle C of a graph G is a m-distance-dominating cycle if for all vertices of . Defining denotes the minimum value of the degree sum of any k independent vertices of G. In this paper, we prove that if G is a 3-connected graph on n vertices, and if , then every longest cycle is m-distance-dominating cycles. 展开更多
关键词 Degree Sums Distance dominating cycles Insertible Vertex
下载PDF
A Local Condition on Dominating Cycles in Graphs
2
作者 CHEN Yufu Department of Mathematics, Jinzhou Teacher’s College, Jinzhou 121003, LiaoningLI Guojun Department of Mathematics, Yantai Teacher’s College, Yantai 264000, Shandong 《Systems Science and Systems Engineering》 CSCD 1993年第4期357-362,共6页
Let G be a graph and S a subset of vertices of G. In the paper we give a local condition on cycles in G dominating all vertices of S with large sums. We also derive some consequences on local hamiltonian conditions.
关键词 cycle dominating cycle κ-independent.
原文传递
Degree sums,connectivity and dominating cycles in graphs
3
《Chinese Science Bulletin》 SCIE CAS 1998年第4期351-351,共1页
关键词 Degree sums connectivity and dominating cycles in graphs
原文传递
An Implicit Degree Condition for Relative Length of Long Paths and Cycles in Graphs 被引量:1
4
作者 Jun-qing CAI Hao LI 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2016年第2期365-372,共8页
For a graph G, we denote by p(G) and c(G) the number of vertices of a longest path and a longest cycle in G, respectively. For a vertex v in G, id(v) denotes the implicit degree of v. In this paper, we obtain th... For a graph G, we denote by p(G) and c(G) the number of vertices of a longest path and a longest cycle in G, respectively. For a vertex v in G, id(v) denotes the implicit degree of v. In this paper, we obtain that if G is a 2-connected graph on n vertices such that the implicit degree sum of any three independent vertices is at least n + 1, then either G contains a hamiltonian path, or c(G) 〉 p(G) - 1. 展开更多
关键词 Hamiltonian path dominating cycles implicit degree longest paths longest cycles
原文传递
On the Characterization of Maximal Planar Graphs with a Given Signed Cycle Domination Number 被引量:1
5
作者 Xiao Ming PI 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2018年第5期911-920,共10页
Let G = (V, E) be a simple graph. A function f : E → {+1,-1} is called a signed cycle domination function (SCDF) of G if ∑e∈E(C) f(e) ≥ 1 for every induced cycle C of G. The signed cycle domination numbe... Let G = (V, E) be a simple graph. A function f : E → {+1,-1} is called a signed cycle domination function (SCDF) of G if ∑e∈E(C) f(e) ≥ 1 for every induced cycle C of G. The signed cycle domination number of G is defined as γ′sc(G) = min{∑e∈E f(e)| f is an SCDF of G}. This paper will characterize all maxima] planar graphs G with order n ≥ 6 and γ′sc(G) =n. 展开更多
关键词 Domination number signed cycle domination function signed cycle domination number planar graph maximal planar graph
原文传递
HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS
6
作者 LI Guojun LIU Zhenhong 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1996年第4期295-305,共11页
Let F be a graph consisting of a triangle with a pendant leaf dangling from each vertex.A graph is{K_(1,3),F}-free if it contains no induced subgraph isomorphic to K_(1,3)or F.We give a stronger structural characteris... Let F be a graph consisting of a triangle with a pendant leaf dangling from each vertex.A graph is{K_(1,3),F}-free if it contains no induced subgraph isomorphic to K_(1,3)or F.We give a stronger structural characterisation of{K_(1,3),F}-free graph with which we obtain a more general result than that in[1]as follows:Given any two venices in a 2-connected{K_(1,3),F}-free graph,if there exists a shortest path between them containing no 2-cutset of the graph,then the graph has a Hamilton path cormecting these two venices. 展开更多
关键词 {K_(1 3) F}-free graph Hamilton connected vertex dominating cycle.
原文传递
Observed,Reconstructed,and Simulated Decadal Variability of Summer Precipitation over Eastern China 被引量:6
7
作者 Jingyun ZHENG Maowei WU +2 位作者 Quansheng GE Zhixin HAO Xuezhen ZHANG 《Journal of Meteorological Research》 SCIE CSCD 2017年第1期49-60,共12页
Based on observations made during recent decades, reconstructed precipitation for the period A.D. 1736-2000, dry-wet index data for A.D. 500-2000, and a 1000-yr control simulation using the Community Earth System Mode... Based on observations made during recent decades, reconstructed precipitation for the period A.D. 1736-2000, dry-wet index data for A.D. 500-2000, and a 1000-yr control simulation using the Community Earth System Model with fixed pre-industrial external forcing, the decadal variability of summer precipitation over eastem China is stud- ied. Power spectrum analysis shows that the dominant cycles for the decadal variation of summer precipitation are: 22-24 and quasi-70 yr over the North China Plain; 32-36, 44-48, and quasi-70 yr in the Jiang-Huai area; and 32-36 and 4448 yr in the Jiang-Nan area. Bandpass decomposition from observation, reconstruction, and simulation re- veals that the variability of summer precipitation over the North China Plain, Jiang-Huai area, and Jiang-Nan area, at scales of 20-35, 35-50, and 50-80 yr, is not consistent across the entire millennium. We also find that the warm (cold) phase of the Pacific Decadal Oscillation generally corresponds to dry (wet) conditions over the North China Plain, but wet (dry) conditions in the Jiang-Nan area, from A.D. 1800, when the PDO became strengthened. However, such a correspondence does not exist throughout the entire last millennium. Data-model comparison sug- gests that these decadal oscillations and their temporal evolution over eastem China, including the decadal shifts in the spatial pattem of the precipitation anomaly observed in the late 1970s, early 1990s, and early 2000s, might result from internal variability of the climate system. 展开更多
关键词 decadal variability dominant cycle summer precipitation eastern China data-model comparison
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部