We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and isometry of universal covers. We characterize faithful ...
Based on the relationship between the covering graph theory and the voltage graph theory,using the representation of finite groups to study the voltage graph further,this paper explicits decomposition formulas for the characteristic polynomial of a possibly irregular covering of a finite graph and a ...
1.Arc-transitive cyclic regular coverings of K_5;K_5的弧传递循环正则覆盖 2.The invariants which determine the graphs is discussed according to the theory of group,then the formula for the characteristic polynomials of an oriented regular covering of a finite digraph and the formula for the char...
This synthesis of algebraic and analytic methodologies not only allows us to attain our improved bounds but also provides new insights into the behavior of general independent sets in normal Cayley graphs over symmetric groups. 展开 年份: 2023 ...
In: Harary F (ed) Graph theory and theoretical physics. Academic, New York, pp 111–137 Google Scholar Caporaso L, Viviani F (2010) Torelli theorem for graphs and tropical curves. Duke Math J 153:129–171 Article MathSciNet MATH Google Scholar Charlap LS (1986) Bieberbach groups and...
Let Y be a connected group and let f : X -> Y be a covering map with the total space X being connected: We consider the following question: Is it possible to define a topological group structure on X in such a way that f becomes a homomorphism of topological groups. This holds in ...
enrich the theory of fuzzy covering-based rough set but also provide a new perspective for multiple criteria decision making with uncertainty. Corresponding author Bin Yang. Cite this article Yang, B. Fuzzy covering-based rough set on two different universes and its application.Artif Intell Rev55...
A cover starter is a single vector that yields a covering array under the actions of groups on both the columns and the symbols of the starter. The existence of this compact representation of covering arrays facilitates effective exhaustive and heuristic search. When the group action on symbols ...
F Harary,AJ Schwenk - 《Graph Theory & Computing》 被引量: 219发表: 1972年 Clique coverings of graphs V: maximal-clique partitions A maximal-clique partition of a graph G is a way of covering G with maximal complete subgraphs, such that every edge belongs to exactly one of the subgraphs...
Multiple Submodular Covering Constraints:The input consists of a ground setNand a weight function. The input consists ofrpolymatroidsoverNand integers. The goal is to findof minimum weight such thatfor. We refer to this asMulti-Submod-Cover. ...