domination parameters of a graph with added vertex
Clicks: 63
ID: 136442
2004
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
18.6
/100
63 views
6 readers
AI Quality Assessment
Not analyzed
Readership in this journal
StarRanked #95 of 95 articles by views in zhonghua yi xue za zhi
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Let \(G=(V,E)\) be a graph. A subset \(D\subseteq V\) is a total dominating set of \(G\) if for every vertex \(y\in V\) there is a vertex \(x\in D\) with \(xy\in E\). A subset \(D\subseteq V\) is a strong dominating set of \(G\) if for every vertex \(y\in V-D\) there is a vertex \(x\in D\) with \(xy\in E\) and \(\deg _{G}(x)\geq\deg _{G}(y)\). The total domination number \(\gamma _{t}(G)\) (the strong domination number \(\gamma_{S}(G)\)) is defined as the minimum cardinality of a total dominating set (a strong dominating set) of \(G\). The concept of total domination was first defined by Cockayne, Dawes and Hedetniemi in 1980 [Cockayne E. J., Dawes R. M., Hedetniemi S. T.: Total domination in graphs. Networks 10 (1980), 211–219], while the strong domination was introduced by Sampathkumar and Pushpa Latha in 1996 [Pushpa Latha L., Sampathkumar E.: Strong weak domination and domination balance in a graph. Discrete Mathematics 161 (1996), 235–242]. By a subdivision of an edge \(uv\in E\) we mean removing edge \(uv\), adding a new vertex \(x\), and adding edges \(ux\) and \(vx\). A graph obtained from \(G\) by subdivision an edge \(uv\in E\) is denoted by \(G\oplus u_{x}v_{x}\). The behaviour of the total domination number and the strong domination number of a graph \(G\oplus u_{x}v_{x}\) is developed.
| Reference Key |
zwierzchowski2004opusculadomination
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Maciej Zwierzchowski |
| Journal | zhonghua yi xue za zhi |
| Year | 2004 |
| DOI |
DOI not found
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.