scholarly journals Dominator color class dominating sets on ladder, open ladder and slanting ladder graphs

2021 ◽  
Vol 5 (2) ◽  
pp. 132-137
Author(s):  
Niju P ◽  
Vijayalekshmi A
Keyword(s):  
Dominating Sets ◽  
Color Class ◽  
Ladder Graphs

scholarly journals Introduction of color class dominating sets in graphs

2020 ◽  
Vol 8 (4) ◽  
pp. 2186-2189
Author(s):  
A. Vijayalekshmi ◽  
A. E. Prabha
Keyword(s):  
Dominating Sets ◽  
Color Class

Algorithms to Compute some Dominating Sets of ES (N, K) and ESC (N, K)

2014 ◽  
Vol 4 (1) ◽  
pp. 35
Author(s):  
Pious Missier ◽  
Anto Kinsley ◽  
Evangeline Prathibha Fernando
Keyword(s):  
Dominating Sets

Independent perfect dominating sets in semi-Cayley graphs

2021 ◽  
Author(s):  
Xiaomeng Wang ◽  
Shou-Jun Xu ◽  
Xianyue Li
Keyword(s):  
Cayley Graphs ◽  
Dominating Sets

scholarly journals Blocking total dominating sets via edge contractions

2021 ◽  
Author(s):  
E. Galby ◽  
F. Mann ◽  
B. Ries
Keyword(s):  
Dominating Sets

scholarly journals Topological invariants for the line graphs of some classes of graphs

2019 ◽  
Vol 17 (1) ◽  
pp. 1483-1490
Author(s):  
Xiaoqing Zhou ◽  
Mustafa Habib ◽  
Tariq Javeed Zia ◽  
Asim Naseem ◽  
Anila Hanif ◽  
...  
Keyword(s):  
Communication Theory ◽  
Chemical Reactivity ◽  
Line Graph ◽  
Chemical Properties ◽  
Topological Invariants ◽  
Line Graphs ◽  
Physical And Chemical Properties ◽  
Physical And Chemical ◽  
Ladder Graphs ◽  
And Chemical Properties

AbstractGraph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics. A topological index (TI) is a real number attached to graph networks and correlates the chemical networks with physical and chemical properties, as well as with chemical reactivity. In this paper, our aim is to compute degree-dependent TIs for the line graph of the Wheel and Ladder graphs. To perform these computations, we first computed M-polynomials and then from the M-polynomials we recovered nine degree-dependent TIs for the line graph of the Wheel and Ladder graphs.

scholarly journals Locating and paired-dominating sets in graphs

2009 ◽  
Vol 157 (15) ◽  
pp. 3268-3280 ◽  
Author(s):  
John McCoy ◽  
Michael A. Henning
Keyword(s):  
Dominating Sets

High-energy behaviour of ladder graphs with multiple loops

1971 ◽  
Vol 2 (22) ◽  
pp. 1146-1148 ◽  
Author(s):  
Z. Horváth ◽  
G. Pócsik
Keyword(s):  
High Energy ◽  
Energy Behaviour ◽  
Ladder Graphs

scholarly journals Efficient enumeration of dominating sets for sparse graphs

2021 ◽  
Author(s):  
Kazuhiro Kurita ◽  
Kunihiro Wasa ◽  
Hiroki Arimura ◽  
Takeaki Uno
Keyword(s):  
Dominating Sets ◽  
Sparse Graphs

Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks

2009 ◽  
Vol 20 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Donghyun Kim ◽  
Yiwei Wu ◽  
Yingshu Li ◽  
Feng Zou ◽  
Ding-Zhu Du
Keyword(s):  
Wireless Networks ◽  
Dominating Sets ◽  
Connected Dominating Sets
Sign in / Sign up

Export Citation Format

Share Document