Secure Domination in Lict Graphs
For any graph \(G=(V,E)\), lict graph \(\eta(G)\) of a graph \(G\) is the graph whose vertex set is the union of the set of edges and the set of cut-vertices of \(G\) in which two vertices are adjacent if and only if the corresponding edges are adjacent or the corresponding members of \(G\) are inci...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ptolemy Scientific Research Press
2018-06-01
|
| Series: | Open Journal of Mathematical Sciences |
| Subjects: | |
| Online Access: | https://openmathscience.com/secure-domination-in-lict-graphs/ |