Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three

2006 ◽  
pp. 556-564 ◽  
Author(s):  
Grażyna Zwoźniak
Keyword(s):  
Maximum Degree ◽  
Dominating Sets ◽  
Independent Edge

Pitchfork domination in graphs

2020 ◽  
Vol 12 (02) ◽  
pp. 2050025
Author(s):  
Manal N. Al-Harere ◽  
Mohammed A. Abdlhusein
Keyword(s):  
Maximum Degree ◽  
Undirected Graph ◽  
Minimum Degree ◽  
Dominating Set ◽  
Domination Number ◽  
Dominating Sets ◽  
Minimum Cardinality ◽  
New Model ◽  
Domination In Graphs

In this paper, a new model of domination in graphs called the pitchfork domination is introduced. Let [Formula: see text] be a finite, simple and undirected graph without isolated vertices, a subset [Formula: see text] of [Formula: see text] is a pitchfork dominating set if every vertex [Formula: see text] dominates at least [Formula: see text] and at most [Formula: see text] vertices of [Formula: see text], where [Formula: see text] and [Formula: see text] are non-negative integers. The domination number of [Formula: see text], denotes [Formula: see text] is a minimum cardinality over all pitchfork dominating sets in [Formula: see text]. In this work, pitchfork domination when [Formula: see text] and [Formula: see text] is studied. Some bounds on [Formula: see text] related to the order, size, minimum degree, maximum degree of a graph and some properties are given. Pitchfork domination is determined for some known and new modified graphs. Finally, a question has been answered and discussed that; does every finite, simple and undirected graph [Formula: see text] without isolated vertices have a pitchfork domination or not?

scholarly journals On the Total Outer k-Independent Domination Number of Graphs

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 194 ◽  
Author(s):  
Abel Cabrera-Martínez ◽  
Juan Carlos Hernández-Gómez ◽  
Ernesto Parra-Inza ◽  
José María Sigarreta Almira
Keyword(s):  
Maximum Degree ◽  
Dominating Set ◽  
Domination Number ◽  
Dominating Sets ◽  
Minimum Cardinality ◽  
Total Dominating Set ◽  
Np Hard Problem ◽  
Independent Domination ◽  
Independent Dominating Set ◽  
Computational Properties

A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph induced by the vertices that are not in D is less or equal to k − 1 . The minimum cardinality among all total outer k-independent dominating sets is the total outer k-independent domination number of G. In this article, we introduce this parameter and begin with the study of its combinatorial and computational properties. For instance, we give several closed relationships between this novel parameter and other ones related to domination and independence in graphs. In addition, we give several Nordhaus–Gaddum type results. Finally, we prove that computing the total outer k-independent domination number of a graph G is an NP-hard problem.

scholarly journals Dominating sets, packings, and the maximum degree

2011 ◽  
Vol 311 (18-19) ◽  
pp. 2031-2036 ◽  
Author(s):  
Michael A. Henning ◽  
Christian Löwenstein ◽  
Dieter Rautenbach
Keyword(s):  
Maximum Degree ◽  
Dominating Sets

On Dominating Sets and Independent Sets of Graphs

1999 ◽  
Vol 8 (6) ◽  
pp. 547-553 ◽  
Author(s):  
JOCHEN HARANT ◽  
ANJA PRUCHNEWSKI ◽  
MARGIT VOIGT
Keyword(s):  
Upper Bound ◽  
Maximum Degree ◽  
Dominating Set ◽  
Domination Number ◽  
Independent Set ◽  
Dominating Sets ◽  
Integral Vector ◽  
Vertex Set ◽  
Usual Concept ◽  
Dimensional Cube

For a graph G on vertex set V = {1, …, n} let k = (k1, …, kn) be an integral vector such that 1 [les ] ki [les ] di for i ∈ V, where di is the degree of the vertex i in G. A k-dominating set is a set Dk ⊆ V such that every vertex i ∈ V[setmn ]Dk has at least ki neighbours in Dk. The k-domination number γk(G) of G is the cardinality of a smallest k-dominating set of G.For k1 = · · · = kn = 1, k-domination corresponds to the usual concept of domination. Our approach yields an improvement of an upper bound for the domination number found by N. Alon and J. H. Spencer.If ki = di for i = 1, …, n, then the notion of k-dominating set corresponds to the complement of an independent set. A function fk(p) is defined, and it will be proved that γk(G) = min fk(p), where the minimum is taken over the n-dimensional cube Cn = {p = (p1, …, pn) [mid ] pi ∈ ℝ, 0 [les ] pi [les ] 1, i = 1, …, n}. An [Oscr ](Δ22Δn-algorithm is presented, where Δ is the maximum degree of G, with INPUT: p ∈ Cn and OUTPUT: a k-dominating set Dk of G with [mid ]Dk[mid ][les ]fk(p).

scholarly journals A randomized algorithm for determining dominating sets in graphs of maximum degree five

2009 ◽  
Vol 410 (47-49) ◽  
pp. 5122-5127 ◽  
Author(s):  
Soheir M. Khamis ◽  
Sameh S. Daoud ◽  
Hanaa A.E. Essa
Keyword(s):  
Maximum Degree ◽  
Randomized Algorithm ◽  
Dominating Sets

Non-standard methods for converting numbers from one number system to another

2020 ◽  
Vol 1 (9) ◽  
pp. 28-30
Author(s):  
D. M. Zlatopolski
Keyword(s):  
Binary System ◽  
Maximum Degree ◽  
Number System ◽  
Binary Form ◽  
Binary Number ◽  
Standard Methods ◽  
Optimal Variant ◽  
Decimal System ◽  
Large Numbers ◽  
Independent Work

The article describes a number of little-known methods for translating natural numbers from one number system to another. The first is a method for converting large numbers from the decimal system to the binary system, based on multiple divisions of a given number and all intermediate quotients by 64 (or another number equal to 2n ), followed by writing the last quotient and the resulting remainders in binary form. Then two methods of mutual translation of decimal and binary numbers are described, based on the so-called «Horner scheme». An optimal variant of converting numbers into the binary number system by the method of division by 2 is also given. In conclusion, a fragment of a manuscript from the beginning of the late 16th — early 17th centuries is published with translation into the binary system by the method of highlighting the maximum degree of number 2. Assignments for independent work of students are offered.

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

The Image of the Accountant in a German Context

2004 ◽  
Vol 4 (1) ◽  
pp. 62-89 ◽  
Author(s):  
Andreas Hoffjan
Keyword(s):  
Content Analysis ◽  
Empirical Study ◽  
Cost Reduction ◽  
Maximum Degree ◽  
Work Ethic ◽  
Personal Characteristics ◽  
Management Accountant ◽  
The Subject ◽  
Professional Context

This study introduces content analysis as a method of examining the accountant's role. The empirical study is based on 73 advertisements, which are directed primarily at employees who are affected by the management accountant's work. The findings of the study indicate that the subject of accountancy is used particularly in connection with promises of “cost reduction.” Consequently, the majority of advertisements use the accountant stereotype of “savings personified.” In a professional context, the work ethic of the management accountant is given particular emphasis in the advertisements. He/she identifies him/herself with his/her task to the maximum degree, is regarded as loyal to his/her company and, for the most part, is well organized in his/her work. However, the characterization of the management accountant as a well disciplined company-person conflicts with the negative portrayal of his/her professional qualities. In advertisements, the management accountant is portrayed as a rather inflexible, passive, and uncreative specialist who, as a result of these qualities, often demotivates others. The personal characteristics of the management accountant are shown in a negative light. This gives him/her the unappealing image of a humorless, envious, dissociated, and ascetic corporate-person.

Independent perfect dominating sets in semi-Cayley graphs

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

Export Citation Format

Share Document