z-logo
open-access-imgOpen Access
Super Fair Dominating Set in the Cartesian Product of Graphs
Author(s) -
Glenna T. Gemina,
Enrico L. Enriquez
Publication year - 2020
Publication title -
international journal of engineering and management research
Language(s) - English
Resource type - Journals
eISSN - 2394-6962
pISSN - 2250-0758
DOI - 10.31033/ijemr.10.3.2
Subject(s) - cartesian product , dominating set , product (mathematics) , cartesian coordinate system , mathematics , set (abstract data type) , combinatorics , computer science , discrete mathematics , graph , geometry , vertex (graph theory) , programming language
In this paper, we characterize the super fair dominating set in the Cartesian product of two graphs and give some important results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom