Graphs constructible from cycles and complete graphs

Jamison Robert E.; Mulder Henry Martyn

首页> 外文期刊>Discrete mathematics >Graphs constructible from cycles and complete graphs

【24h】

Graphs constructible from cycles and complete graphs

机译：从周期和完整图表构造的图表

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

团队文献服务 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

A graph G is Theta(3)-closed provided any two vertices of G that are joined by three internally disjoint paths are adjacent. We show that the Theta(3)-closed graphs are precisely those that can be obtained by gluing together cliques and cycles along vertices or edges. (C) 2017 Elsevier B.V. All rights reserved.

著录项

来源
《Discrete mathematics 》 |2017年第9期| 共6页
作者
Jamison Robert E.; Mulder Henry Martyn;
展开▼
作者单位

Clemson Univ Discrete Math Clemson SC 29634 USA;

Erasmus Univ Econometr Inst POB 1738 NL-3000 DR Rotterdam Netherlands;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学 ;
关键词
Cycle; Clique; m-sum; Theta(n)-closed; Menger;

机译：循环;集团;m-sum;θ（n） - 关闭;menger;

相似文献

外文文献
中文文献
专利

1. COMPLETE MULTIPARTITE DECOMPOSITIONS OF COMPLETE GRAPHS AND COMPLETE n-PARTITE GRAPHS [J] . HuangQingxue 高校应用数学学报：英文版 . 2003 ,第003期
2. CONSTRUCTING THE HAMILTON CYCLE ON γ-ARY DE BRUIJN-GOOD GRAPH——THE γ-ARY DE BRUIJN SEQUENCE [J] . 杨君辉系统科学与复杂性：英文版 . 1991 ,第001期
3. Vertex-distinguishing VE-total Colorings of Cycles and Complete Graphs [J] . XIN Xiao-qing, CHEN Xiang-en, WANG Zhi-wen 数学季刊（英文版） . 2012 ,第001期
4. Dual-stage constructed random graph algorithm to generate random graphs featuring the same topological characteristics with power grids [J] . Shiqian MA, Yixin YU, Lei ZHAO 现代电力系统与清洁能源学报(英文) . 2017 ,第005期
5. Graphs constructible from cycles and complete graphs [J] . Jamison Robert E., Mulder Henry Martyn Discrete mathematics . 2017 ,第9期

机译：从周期和完整图表构造的图表
6. Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles [J] . El-Zanati Saad I., Jongthawonwuth Uthoomporn, Jordon Heather, European journal of combinatorics . 2018 ,第期

机译：将完整图分解和完整的图形减去一个图形G的副本，其中G是两个不相交周期的结合
7. On Orthogonal Double Covers of Complete Bipartite Graphs by an Infinite Certain Graph-Path and Graph-Cycle [J] . R. A. El-Shanawany British Journal of Mathematics & Computer Science . 2014 ,第16期

机译：关于无限二等图路径和图循环的完全二部图的正交双覆盖
8. Maximal Cyclic 4-Cycle Packings and Minimal Cyclic 4-Cycle Coverings of the Complete Graph [C] . Robert Gardner, Chrysanthus Gwellem, Janice Lewenczuk Southeastern International Conference on Combinatorics, Graph Theory and Computing; 20060306-10; Boca Raton,FL(US) . 2006

机译：完整图的最大循环4循环填充和最小循环4循环覆盖
9. On Hamilton Cycle Decompositions of Complete Multipartite Graphs Which Are Both Cyclic and Symmetric [D] . Akinola, Fatima A. 2021

机译：汉密尔顿循环的完整多重图循环分解，它们都是循环和对称的
10. Corrigendum to: Evidence synthesis for constructing directed acyclic graphs (ESC-DAGs): a novel and systematic method for building directed acyclic graphs [O] . Karl D Ferguson, Mark McCann, Srinivasa Vittal Katikireddi, -1

机译：勘误：构造有向无环图（ESC-DAG）的证据综合：建立有向无环图的一种新颖而系统的方法
11. Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs [O] . Manikandan R.S., Paulraja P. 2010

机译：完全二部图和完全多部图的张量积的汉密尔顿循环分解
12. DENDRAL: A system for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs. Part 3: Complete chemical graphs; embedding rings in trees [R] . Lederberg, J. 1968

机译：DENDRaL：用于计算机构造，枚举和有机分子符号的系统，如树结构和循环图。第3部分：完整的化学图表;在树中嵌入环

Graphs constructible from cycles and complete graphs

摘要

著录项

相似文献

相关主题

期刊订阅