Results 241 to 250 of about 285,444 (268)
Some of the next articles are maybe not open access.
On the cycle‐isomorphism of graphs
Journal of Graph Theory, 1991AbstractThis paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity ⩾ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs G of connectivity 1 such that every graph that is cycle‐isomorphic to G is also isomorphic to G.
openaire +1 more source
Networks, 1979
AbstractThe paper deals with bases of the vector space associated with a graph. Section 2 presents two characterizations of the cycle basis which can be derived from a spanning tree of a graph, and Section 3 contains the counterexamples for the conjecture of Dixon and Goodman. Finally, some new problems are posed.
openaire +2 more sources
AbstractThe paper deals with bases of the vector space associated with a graph. Section 2 presents two characterizations of the cycle basis which can be derived from a spanning tree of a graph, and Section 3 contains the counterexamples for the conjecture of Dixon and Goodman. Finally, some new problems are posed.
openaire +2 more sources
Journal of Graph Theory, 1995
AbstractLet k and n be two integers such that k ≥ 0 and n ≥ 3(k + 1). Let G be a graph of order n with minimum degree at least ⌈(n + k)/2⌉. Then G contains k + 1 independent cycles covering all the vertices of G such that k of them are triangles. © 1995, John Wiley & Sons, Inc.
openaire +1 more source
AbstractLet k and n be two integers such that k ≥ 0 and n ≥ 3(k + 1). Let G be a graph of order n with minimum degree at least ⌈(n + k)/2⌉. Then G contains k + 1 independent cycles covering all the vertices of G such that k of them are triangles. © 1995, John Wiley & Sons, Inc.
openaire +1 more source
SIAM Journal on Discrete Mathematics, 2012
Closed promenades are closed walks on a graph that can be thought of as generalized circuits, as they correspond to circuits on some cover of the graph. We give a partial characterization of the set of indecomposable closed promenades, which are related to the irreducible closed promenades of Feldman and the non-positive cost minimal and skeleton ...
openaire +1 more source
Closed promenades are closed walks on a graph that can be thought of as generalized circuits, as they correspond to circuits on some cover of the graph. We give a partial characterization of the set of indecomposable closed promenades, which are related to the irreducible closed promenades of Feldman and the non-positive cost minimal and skeleton ...
openaire +1 more source
ON CYCLE CONNECTIVITY OF GRAPHS
Journal of Interconnection Networks, 2012In this article, the concept of cycle connectivity of a weighted graph is discussed. Cycle connectivity of partial trees, cycles and precisely weighted graphs are obtained. Also the concepts of cyclic cutnode and cyclic bridge in weighted graphs are introduced and a condition for a precisely weighted graph to possess a cyclic cutnode is obtained.
openaire +1 more source
The American Mathematical Monthly, 2008
If a group G of automorphisms of a graph Γ acts transitively on the set of vertices, then Γ is d-valent for some d: each vertex is adjacent to exactly d others. This note concerns cycles in Γ, by which we will mean subgraphs isomorphic to a k-cycle for some k ≥ 3; hence there will be no “initial” vertex.
openaire +2 more sources
If a group G of automorphisms of a graph Γ acts transitively on the set of vertices, then Γ is d-valent for some d: each vertex is adjacent to exactly d others. This note concerns cycles in Γ, by which we will mean subgraphs isomorphic to a k-cycle for some k ≥ 3; hence there will be no “initial” vertex.
openaire +2 more sources
CYCLES IN TRIANGLE-FREE GRAPHS
Discrete Mathematics, Algorithms and Applications, 2011Let G be a k-connected (k ≥ 3), triangle-free graph with α(G) ≤ k + 1. If G is not Petersen graph and G ∉ {Kk, k, Kk, k + 1, Kk + 1, k+1}, then G contains cycles of lengths from 4 to |V(G)|. This generalizes a result conjectured by Amar et al. (Graphs Combin.7 (1991)) and proved by Lou (Discrete Math.152 (1996)).
Xiaojuan Li, Bing Wei 0001, Yongjin Zhu
openaire +2 more sources
A graph database for life cycle inventory using Neo4j
Journal of Cleaner Production, 2023Mohamed Saad, Yingzhong Zhang
exaly
Sparse Pose Graph Optimization in Cycle Space
IEEE Transactions on Robotics, 2021Fang Bai +2 more
exaly
Cycle Multiplicity of Total Graph of Complete Bipartite Graph
Open Journal of Discrete Mathematics, 2023Yinkui Li
exaly