ON DOUBLE SIGNAL NUMBER OF A GRAPH
A set \(S\) of vertices in a connected graph \(G=(V,E)\) is called a signal set if every vertex not in \(S\) lies on a signal path between two vertices from \(S\). A set \(S\) is called a double signal set of \(G\) if \(S\) if for each pair of vertices \(x,y \in G\) there exist \(u,v \in S\) such th...
Main Authors: | X. Lenin Xaviour, S. Ancy Mary |
---|---|
Format: | Article |
Language: | English |
Published: |
Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin.
2022-07-01
|
Series: | Ural Mathematical Journal |
Subjects: | |
Online Access: | https://umjuran.ru/index.php/umj/article/view/383 |
Similar Items
-
Co-even geodetic number of a graph
by: T Jebaraj, et al.
Published: (2022-12-01) -
The Forcing Geodetic Cototal Domination Number of a Graph
by: S L Sumi, et al.
Published: (2022-12-01) -
Geodetic Domination Integrity of Thorny Graphs
by: Şeyma Onur, et al.
Published: (2024-03-01) -
An O(mn2) Algorithm for Computing the Strong Geodetic Number in Outerplanar Graphs
by: Mezzini Mauro
Published: (2022-05-01) -
On Minimal Geodetic Domination in Graphs
by: Nuenay Hearty M., et al.
Published: (2015-08-01)