Generalized Power Domination in Regular Graphs

Paul Dorbec; Michael A. Henning; Christian Löwenstein; Mickaël Montassier; André Raspaud

doi:10.1137/120891356

ScienceGate Book Chapters

JOURNAL ARTICLE

Generalized Power Domination in Regular Graphs

Paul Dorbec Michael A. Henning Christian Löwenstein Mickaël Montassier André Raspaud

Year: 2013 Journal: SIAM Journal on Discrete Mathematics Vol: 27 (3)Pages: 1559-1574 Publisher: Society for Industrial and Applied Mathematics

DOI: 10.1137/120891356

Get Full-Text PDF Get Analytical Report

Abstract

International audience

Keywords:

Mathematics Domination analysis Combinatorics Dominating set Vertex (graph theory) Graph Discrete mathematics

Metrics

Cited By

3.94

FWCI (Field Weighted Citation Impact)

Refs

0.95

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

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Network Packet Processing and Optimization

Physical Sciences → Computer Science → Hardware and Architecture

Generalized Power Domination in Regular Graphs

Abstract

Metrics

Citation History

Topics

Related Documents

Generalized Power Domination in Claw-Free Regular Graphs

Generalized power domination of graphs

Power domination in regular claw-free graphs

Power domination in the generalized Petersen graphs

Generalized Power Domination: Propagation Radius and Sierpiński Graphs