Generalization of restrained triple connected outer perfect domination number for square of grid graphs

K. Priya; G. Mahadevan; C. Sivagnanam

doi:10.1007/s41478-023-00656-6

ScienceGate Book Chapters

JOURNAL ARTICLE

Generalization of restrained triple connected outer perfect domination number for square of grid graphs

K. Priya G. Mahadevan C. Sivagnanam

Year: 2023 Journal: The Journal of Analysis Vol: 32 (4)Pages: 2185-2198 Publisher: Springer Science+Business Media

DOI: 10.1007/s41478-023-00656-6

Get Full-Text PDF Get Analytical Report

Keywords:

Dominating set Mathematics Combinatorics Domination analysis Square (algebra) Generalization Matching (statistics) Grid Cardinality (data modeling) Set (abstract data type) Discrete mathematics Computer science Graph Geometry Mathematical analysis

Metrics

Cited By

0.31

FWCI (Field Weighted Citation Impact)

Refs

0.56

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Generalization of restrained triple connected outer perfect domination number for square of grid graphs

Metrics

Citation History

Topics

Related Documents

Restrained triple connected outer perfect domination number for derived graphs

Outer Triple Connected Corona Domination Number of Graphs

Restrained 2-Domination Number of Complete Grid Graphs

Restrained perfect domination in graphs

Generalization of the total outer-connected domination in graphs