Shortest Co-cycle Bases of Graphs
نویسندگان
چکیده
In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) of connected graphs, which are related with map geometries, i.e., Smarandache 2dimensional manifolds. By using a Hall type theorem for base transformation, we show that the shortest co-cycle bases have the same structure (there is a 1-1 correspondence between two shortest co-cycle bases such that the corresponding elements have the same length). As an application in surface topology, we show that in an embedded graph on a surface any nonseparating cycle can’t be generated by separating cycles. Based on this result, we show that in a 2-connected graph embedded in a surface, there is a set of surface nonseparating cycles which can span the cycle space. In particular, there is a shortest base consisting surface nonseparating cycle and all such bases have the same structure. This extends a Tutte’s result [4].
منابع مشابه
The metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملOn finding cycle bases and fundamental cycle bases with a shortest maximal cycle
An undirected biconnected graph G with nonnegative integer lengths on the edges is given. The problem we consider is that of finding a cycle basis B of G such that the length of the longest cycle included in B is the smallest among all cycle bases of G. We first observe that Horton’s algorithm [SIAM J. Comput. 16 (2) (1987) 358–366] provides a fast solution of the problem that extends the one g...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملShortest cycle covers and cycle double covers with large 2-regular subgraphs
In this paper we show that many snarks have shortest cycle covers of length 43m + c for a constant c, where m is the number of edges in the graph, in agreement with the conjecture that all snarks have shortest cycle covers of length 43m+ o(m). In particular we prove that graphs with perfect matching index at most 4 have cycle covers of length 4 3m and satisfy the (1, 2)-covering conjecture of Z...
متن کاملMinimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in a minimum cycle base (or MCB in short) and then set up a 1-1 correspondence between the set of MCBs and the set of collections of nonseparating cycles which are in general positions on surfaces and are of shortest total...
متن کامل