Journal article

Invariants concerning f -domination in graphs

S Zhou

Bulletin of the Malaysian Mathematical Sciences Society | MALAYSIAN MATHEMATICAL SCIENCES SOC | Published : 2014

Abstract

Given a graph G and a function f : V(G) → {0, 1,2,…}, a subset D of V(G) is called an f-dominating set of G if every vertex x outside D is adjacent to at least f(x) vertices in D. In this article we study a few graphical invariants relating to this concept.

University of Melbourne Researchers

Related Projects (1)

Project icon

Expander graphs, isoperimetric numbers, and forwarding indices

Expanders are sparse but well connected networks. With numerous applications to modern technology, they have attracted many world leaders in..

Grants

Awarded by Australian Research Council

Funding Acknowledgements

The author was supported by a Future Fellowship (FT110100629) of the Australian Research Council.

Citation metrics

2Scopus
1Web of Science

Keywords

Bondage Number
F-Domination
Total F-Domination
Physical Sciences
Science & Technology
Number
Connected F-Domination
Domination Number
Mathematics