CONNECTED DOMINATION STABLE GRAPHS UPON EDGE ADDITION

Desormeaux Wyatt J.; Haynes Teresa W.; van der Merwe Lucas

首页> 外文期刊>Quaestiones mathematicae >CONNECTED DOMINATION STABLE GRAPHS UPON EDGE ADDITION

【24h】

CONNECTED DOMINATION STABLE GRAPHS UPON EDGE ADDITION

机译：边缘添加后的连接控制稳定图

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

A set S of vertices in a graph G is a connected dominating set of G if S dominates G and the subgraph induced by S is connected. We study the graphs for which adding any edge does not change the connected domination number.

机译：如果S支配G且连接了S诱导的子图，则图G中的顶点集S是G的连通支配集。我们研究的图添加任何边不会改变连接的支配数。

著录项

来源
《Quaestiones mathematicae》 |2015年第6期|841-848|共8页
作者
Desormeaux Wyatt J.; Haynes Teresa W.; van der Merwe Lucas;
展开▼
作者单位

Univ Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa;

E Tennessee State Univ, Dept Math & Stat, Johnson City, TN 37614 USA;

Univ Tennessee, Dept Math, Chattanooga, TN 37403 USA;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
Connected domination; connected domination stable; edge addition;

机译：连通支配;连通支配稳定;边缘增加;

相似文献

外文文献
中文文献
专利

1. Equitable Total Domination Edge Addition Stable Graphs [J] . K. Kavitha, N.G. David Journal of combinatorial mathematics and combinatorial computing . 2015,第feba期

机译：合理的总支配边加法稳定图
2. Roman domination stable graphs upon edge-addition [J] . Chellali Mustapha, Rad Nader Jafari Utilitas mathematica . 2015,第Null期

机译：边加法后的罗马统治稳定图
3. Total domination stable graphs upon edge addition [J] . Desormeaux W.J., Haynes T.W., Henning M.A. Discrete mathematics . 2010,第24期

机译：加边后的总支配稳定图
4. Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination [C] . Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos International Workshop on Combinatorial Algorithms . 2020

机译：改进的预算连通支配和预算边缘顶点支配
5. Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies. [D] . Nasab, Reza Zamani. 2011

机译：哈密顿量在二部图中的指定边，统治博弈以及革命者和间谍的博弈之间循环。
6. On Vertex Covering Transversal Domination Number of Regular Graphs [O] . R. Vasanthi, K. Subramanian 2016

机译：关于正则图的顶点覆盖的横向控制数
7. Total domination stable graphs upon edge addition [O] . Desormeaux Wyatt J., Haynes Teresa W., Henning Michael A. 2010

机译：加边后的总支配稳定图
8. Maintenance of 2- and 3-Connected Components of Graphs, Part 2: 2- and 3-Edge-Connected Components and 2-Vertex-Connected Components. [R] . La Poutre, J. A. 1991

机译：图2的2和3连接组件的维护，第2部分：2和3边连接组件和2顶点连接组件。

CONNECTED DOMINATION STABLE GRAPHS UPON EDGE ADDITION

摘要

著录项

相似文献

相关主题

期刊订阅