The detour hull number of a graph
For vertices \(u\) and \(v\) in a connected graph \(G=(V, E)\), the set \(I_D[u,v]\) consists of all those vertices lying on a \(u-v\) longest path in \(G\). Given a set \(S\) of vertices of \(G\), the union of all sets \(I_D[u,v]\) for \(u,v\in S\), is denoted by \(I_D[S]\). A set \(S\) is a detour...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Santhakumaran, A. P., Chandran, S. V. Ullas |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/728 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
The upper edge-to-vertex detour number of a graph
by: Santhakumaran, A. P., et al.
Published: (2018) -
The upper edge-to-vertex detour number of a graph
by: Santhakumaran, A. P., et al.
Published: (2018) -
The detour hull number of a graph
by: Santhakumaran, A.P., et al.
Published: (2012) -
On the zero forcing number of graphs and their splitting graphs
by: Chacko, Baby, et al.
Published: (2019) -
On the zero forcing number of graphs and their splitting graphs
by: Chacko, Baby, et al.
Published: (2019)