Results 271 to 280 of about 1,312,788 (294)
Some of the next articles are maybe not open access.
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
Homological Coverings of Graphs
Journal of the London Mathematical Society, 1984The homology group of a graph, with any coefficient ring, can be used to construct covering graphs. The properties of the covering graph are studied, and it, is proved that they admit group of automorphisms related to the group of the base graph. In the case of cubic graphs the construction throws some light on classification problems and it can be ...
openaire +2 more sources
Combinatorica, 1986
The clique covering number cc(G) of a graph G is the least number of complete subgraphs of G necessary to cover the edge set of G. The author shows that there exists an integer \(n_ 0\) such that for all graphs G on \(n>n_ 0\) vertices \(\max \{cc(G)+cc(\bar G)\}=\lfloor n^ 2/4\rfloor +2.\) This settles a conjecture of Erdős.
openaire +3 more sources
The clique covering number cc(G) of a graph G is the least number of complete subgraphs of G necessary to cover the edge set of G. The author shows that there exists an integer \(n_ 0\) such that for all graphs G on \(n>n_ 0\) vertices \(\max \{cc(G)+cc(\bar G)\}=\lfloor n^ 2/4\rfloor +2.\) This settles a conjecture of Erdős.
openaire +3 more sources
Graph Covering Using Bounded Size Subgraphs
Lecture Notes in Computer Science, 2023Barun Gorain, Rishi Ranjan Singh
exaly
1990
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
On the weighted complexity of a regular covering of a graph
Journal of Combinatorial Theory Series B, 2003Hirobumi Mizuno
exaly
Enumerating Typical Circulant Covering Projections Onto a Circulant Graph
SIAM Journal on Discrete Mathematics, 2005Young Soo Kwon +2 more
exaly
Extending SQL with graph matching, set covering and partitioning
Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an, 1994Jorng-Tzong Horng, Baw-Jhiune Liu
exaly