We give an exponential lower bound for the maximum number of chords in a cycle of a graph G in terms of the minimum degree of G and the girth of G. We also give regular graphs having no small cycles where the maximum number of chords possible in any cycle of the graph is approximatel...
百度试题 结果1 题目A useful diagram to present the life cycle of a cicada(蝉)is ___.A.flow chartB.bar chartC.graphD.cycle 相关知识点: 试题来源: 解析 D 反馈 收藏
What is the graph of one cycle of a sine curve with amplitude 2, period 4π, and a 0? Using the form y = a sin b 日, what is an equation for the sine curve? 相关知识点: 试题来源: 解析 One period= yn amplitude:2 azo so a=2 Period 4r and 4π=(2π)/bsob=1/2一 k T ...
Summary: The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cycle vector space of a graph, a minimum cycle basis can be computed in polynomial time using an algorithm of {\it J. D. Horton} [SIAM J. Comput. 16, No. 2, 358-366 (1987;...
Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new `singular' approach that builds the cycle space of a graph not on its finite cycles but on its topological circles, the homeomorphic images of S in the space formed by the graph togeth...
This article establishes a relationship between the real (circular) flow number of a graph and its cycle rank. We show that a connected graph with real flow number p / q +1, where p and q are two relatively prime numbers must have cycle rank at least p + q - 1. A special case of...
We give a simple proof of Tutte's theorem stating that the cycle space of a 3--connected graph is generated by the set of non-separating circuits of the graph. Keywords: graph, cycle, circuit, cycle space, non-separating circuit, strong isomorphism....
Start DFS traversal on each unvisited vertex (in case the Graph is not connected). During DFS, mark vertices as visited, and run DFS on the adjacent vertices (recursively). If an adjacent vertex is already visited and is not the parent of the current vertex, a cycle is detected, andTrue...
A cycle double cover (CDC) of an undirected graph is a collection of the graph's cycles such that every edge of the graph belongs to exactly two cycles. We describe a constructive method for generating all the cubic graphs that have a 6-CDC (a CDC in which every cycle has length 6)...
Cycle is one of the basic concepts in classical graph theory,however,with the increasingly development of system complexity,there is a variety of uncertainty are frequently encountered in practical application of graph theory.In an uncertain graph,whether two vertices of the graph are joined cannot ...