Transversal Eccentric Domination in Graphs
We introduce transversal eccentric dominating(TED) set. An eccentric dominating set $D$ is called a TED-set if it intersects with every minimum eccentric dominating set $D'$. We find the TED-number $\gamma_{ted}$ of some standard graphs. Results are stated and proved.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Accademia Piceno Aprutina dei Velati
2023-03-01
|
| Series: | Ratio Mathematica |
| Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/1043 |