网页 图片 视频 学术 词典 地图 更多 automorphism-group-of-a-graph 例句 释义: 全部 更多例句筛选 1. Automorphism group of a graph 图自同构群 hk.netsh.com © 2024 Microsoft 隐私声明和 Cookie 法律声明 广告 帮助 反馈
An edge automorphism of a graph is a permutation of the edges of that sends edges with common endpoint into edges with a common endpoint. The set of all edge automorphisms of from a group called the edge automorphism group of , denoted . ...
The semi-arc automorphism group of a graph with application to map enumeration. Graphs Combin., 22(1):83-101, 2006.MAO Lin2fan ,LIU Yan2pei ,WEI Er2ling. The Semi2Arc Automorphism Group of a Graph with Application to Map Enumeration [J ] . Graphs and Combin. ,2006 ,22 :83 - ...
Martin R Pettet, The automorphism group of a graph product of groups, Comm. Algebra 27 (1999) 4691{4708M R Pettet, The automorphism group of a graph product of groups, Comm. Algebra 27 (1999) 4691-4708M.R. Pettet, The automorphism group of a graph product of groups, Comm. Algebra...
We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a graph product of c
Summary: Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question of which pairs of groups can be represented as the...
automorphism group of a graph专业释义 <数学> 图自同构群词条提问 欢迎你对此术语进行提问>> 行业词表 石油纺织轻工业造纸采矿信息学农业冶金化学医学医药地理地质外贸建筑心理学数学机械核能汽车海事消防物理生物学电力电子金融财会证券法律管理经贸人名药名解剖学胚胎学生理学药学遗传学中医印刷商业商务大气科学天文岩土...
The automorphism group of a graph product of groups 来自 掌桥科研 喜欢 0 阅读量: 46 作者:Pettet,Martin R.摘要: A theorem of Karrass, Pietrowski and Solitar on the structure of the automorphism group of an amalgamated free product is extended to automorphism groups of fundamental groups of ...
A graph G is said to be p-periodic if the automorphism group Aut(G) contains an element of order p which preserves no edges. In this short note, we investigate the behavior of graph polynomials (Negami and Tutte) with respect to graph periodicity. In particular, we prove that if p is...
Our proof includes a structural analysis of f i nite edge-transitivegraphs.1 IntroductionFrucht’s classic theorem shows that every abstract group is the automorphism group of a f i nitegraph, and in fact the graph can even be required to be connected and 3-regular [Fru49]. We saythat ...