weakly connected domination critical graphs

Clicks: 208
ID: 141313
2008
Free PDF
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.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #31 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 minted

Create 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
Sign in to mint
Abstract
A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\). The weakly connected domination number \(\gamma_w(G)\) of a graph \(G\) is the minimum cardinality among all weakly connected dominating sets in \(G\). The graph is said to be weakly connected domination critical (\(\gamma_w\)-critical) if for each \(u, v \in V(G)\) with \(v\) not adjacent to \(u\), \(\gamma_w(G + vu) \lt \gamma_w (G)\). Further, \(G\) is \(k\)-\(\gamma_w\)-critical if \(\gamma_w(G) = k\) and for each edge \(e \not\in E(G)\), \(\gamma_w(G + e) \lt k\). In this paper we consider weakly connected domination critical graphs and give some properties of \(3\)-\(\gamma_w\)-critical graphs.
Reference Key
lemaska2008opusculaweakly Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Magdalena Lemańska;Agnieszka Patyk
Journal zhonghua yi xue za zhi
Year 2008
DOI
DOI not found
URL
http://www.opuscula.agh.edu.pl/vol28/3/art/opuscula_math_2824.pdf
Keywords
tree quantitative methods

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.