Computational complexity of covering cyclic graphs
نویسندگان
چکیده
منابع مشابه
Cyclic Path Covering Number of Euler Graphs
In this paper, we introduce a technique to find the cyclic path covering number of Euler graphs, by using the t-hypohamiltonian graphs. Also a special type of Euler graph in the name n-gon is also being introduced and a general result of cpcn of n-gon is also found. Finally an algorithm to find the cyclic path covering number of any Euler graph is being developed. AMS subject classification: 54...
متن کاملComputational Complexity of Graphs
Complexity is one of the crucial scientific phenomena of our times. There are many possible ways tomeasure the “complexity” of a given finite object taken from a known underlying set of objects. In the information-theoretic sense, an object is treated as “complex”, if many binary bits are necessary to encode the object, that is, many bits are necessary to distinguish it from the remaining objec...
متن کاملComputational Complexity of Covering Three-Vertex Multigraphs
A covering projection from a graph G to a graph H is a mapping of the vertices of G to the vertices of H such that, for every vertex v of G, the neighborhood of v is mapped bijectively to the neighborhood of its image. Moreover, if G and H are multigraphs, then this local bijection has to preserve multiplicities of the neighbors as well. The notion of covering projection stems from topology, bu...
متن کاملComputational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Some particularly attractive solution sets are defined in terms of a covering relation—a transitive subrelation of the original relation. We consider three dif...
متن کاملOn the Complexity of Planar Covering of Small Graphs
The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G → H which locally preserves the structure of the graphs). Complexity of this problem has been intensively studied. In this paper, we consider the problem PlanarCover(H) which restricts the input graph G to be planar. PlanarCover(H) is polynomially solvable if Cover(H) belongs t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00262-4