Semi-strong split domination in graphs
Clicks: 143
ID: 276294
2014
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
Popular Article
30.0
/100
143 views
38 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #4 of 4 articles by views in transactions on combinatorics
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
Given a graph $G = (V,E)$, a dominating set $D subseteq V$ is called a semi-strong
split dominating set of $G$ if $|V setminus D| geq 1$ and the maximum degree of the subgraph induced by $V setminus D$ is 1. The minimum cardinality of a semi-strong split dominating set (SSSDS) of G is the semi-strong split domination number of G, denoted $gamma_{sss}(G)$. In this work, we introduce the concept and prove several results regarding it.
| Reference Key |
alwardi2014semistrongtransactions
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Alwardi, Anwar;Ebadi, Karam;, Martin Manrique;Soner, Nsndappa; |
| Journal | transactions on combinatorics |
| Year | 2014 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
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.