Edge Domination Number Research Articles

Edge Domination and Secure Edge Domination in Mycielski Graph of Trees

The secure edge dominating set of a graph G is an edge dominating set F with the property that for each edge e ∈ E − F , there exists f ∈ F adjacent to e such that ( F − { f } ) ∪ { e } is an edge dominating set. In this paper, we obtained upper bounds for edge domination and secure edge domination number for Mycielski of a tree.

Dominating induced matchings and other graph parameters

A matching M in a graph G is an induced matching if the largest degree of the subgraph of G induced by M is equal to one. A dominating induced matching (DIM) of G is an induced matching that dominates every edge of G. It is well known that, if they exist, all dominating induced matchings of G are of the same size. The dominating induced matching number of G, denoted by dim ( G ) , is the size of any dominating induced matching of G. In this paper, we continue the study of dominating induced matchings. We prove that, if G has a DIM, then the induced matching number of G is equal to the independence number of its line graph L(G) and to the edge domination number of G. It is also shown that dim ( G ) ≤ 2 dim ( L ( G ) ) , provided that both G and L(G) have a DIM. We also present some bounds on dim ( G ) . In particular, for a tree T with a DIM we show that ⌈ n − l + 1 3 ⌉ ≤ dim ( T ) ≤ ⌊ n − 1 + l 3 ⌋ , where l is the number of leaves. Moreover, for a regular graph G we establish some Nordhaus-Gaddum type bounds.

Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs

Let G=V;E be a simple graph with vertex set V and edge set E. In a graph G, a subset of edges denoted by M is referred to as an edge-dominating set of G if every edge that is not in M is incident to at least one member of M. A set M⊆E is the locating edge-dominating set if for every two edges e1,e2∈E−M, the sets Ne1∩M and Ne2∩M are nonempty and different. The edge domination number γLG of G is the minimum cardinality of all edge-dominating sets of G. The purpose of this study is to determine the locating edge domination number of certain types of claw-free cubic graphs.

Characterization of Fractional Mixed Domination Number of Paths and Cycles

Let G′ be a simple, connected, and undirected (UD) graph with the vertex set M(G′) and an edge set N(G′). In this article, we define a function f:M∪N⟶0,1 as a fractional mixed dominating function (FMXDF) if it satisfies fRmx=∑yϵRmxfy≥1 for all x∈MG′∪NG′, where Rmx indicates the closed mixed neighbourhood of x, that is the set of all y∈MG′∪NG′ such that y is adjacent to x and y is incident with x and also x itself. Here, pf=∑x∈M∪Nfx is the poundage (or weight) of f. The fractional mixed domination number (FMXDN) is denoted by γfm∗G′ and is designated as the lowest poundage among all FMXDFs of G′. We compute the FMXDN of some common graphs such as paths, cycles, and star graphs, the middle graph of paths and cycles, and shadow graphs. Furthermore, we compute upper bounds for the sum of the two fractional dominating parameters, resulting in the inequality γf1′Τ+γfm∗Τ≤r+p−radΤ−α, where γf1′ and γfm∗ are the fractional edge domination number and FMXDN, respectively. Finally, we compare γfm∗ to other resolvability-related parameters such as metric and fault-tolerant metric dimensions on some families of graphs.

Domination in Plithogenic product fuzzy graphs

Abstract The notion of Plithogenic vertex domination and Plithogenic edge domination in Plithogenic product fuzzy graphs (PPFGs) has been newly introduced and discussed based on P-weights of P-vertices and P-edges respectively with properties, results and examples. Plithogenic vertex domination number and Plithogenic edge domination number for a Plithogenic product fuzzy graph (PPFG), and the bounds and algorithms for and the maximum and minimum values and algorithms for the same are also investigatedthe same are also investigated. Perfect Plithogenic vertex domination and perfect Plithogenic edge domination are presented as special cases of Plithogenic vertex domination and Plithogenic edge domination respectively. It is observed that the P-vertex (P-edge) with the maximum P-weight exists in every Plithogenic vertex (edge) dominating set of a Plithogenic product fuzzy graph. The novelty in these ideas of domination is that a better perception of reality can be obtained through the analysis of both, Plithogenic vertex domination and Plithogenic edge domination, in any Plithogenic product fuzzy graphical structure.

Incidence‐free sets and edge domination in incidence graphs

AbstractA set of edges of a graph is an edge dominating set if every edge of intersects at least one edge of , and the edge domination number is the smallest size of an edge dominating set. Expanding on work of Laskar and Wallis, we study for graphs which are the incidence graph of some incidence structure , with an emphasis on the case when is a symmetric design. In particular, we show in this latter case that determining is equivalent to determining the largest size of certain incidence‐free sets of . Throughout, we employ a variety of combinatorial, probabilistic and geometric techniques, supplemented with tools from spectral graph theory.

Some Results On Total Onto Minus Edge Dominating Functions In Graphs

Let G = (V, E) be a graph. The total onto minus edge dominating function is a function f: E → {−1, 0, 1} such that f is onto and f (N(e)) ≥ 1 for all e ∈ E(G). The total onto minus edge domination number of a graph G is a minimum weight of a set of all total onto minus edge dominating functions of G and it is denoted by .
 In this paper we discuss about the total onto minus edge domination number for some graphs : Star graph, Bistar graph, Friendship graph and Flower graph.

Domination versus edge domination on claw-free graphs

When G is a (finite and simple) graph, we prove that its domination number is at most its edge-domination number if G is a claw-free graph with minimum degree at least two. That generalizes an earlier result of Baste et al. (2020) on cubic claw-free graphs.

Some Characterizations of Whole Edge Domination in Bipolar Fuzzy Graphs

In this paper, Some bounds, theorems and results on whole edge domination number in bipolar fuzzy graph are established with support of some examples. The concepts of perfect, complete perfect and semi-perfect whole edge domination in bipolar fuzzy graph are discussed and investigated with some of their properties and also results on perfect contributed via the support of some examples.

A Study on Co – odd (even) Sum Degree Edge Domination Number in Graphs

An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domination value is defined. Further, the exact values of the above said parameters are found for some standard classes of graphs. The bounds of the co-odd (even) sum degree edge domination number are obtained in terms of basic graph terminologies. The co-odd (even) sum degree edge dominating sets are characterized. The relationships with other edge domination parameters are also studied.

Secure Edge Domination in Neutrosophic Graphs

The concepts of Neutrosophic secure edge domination number and neutrosophic total secure edge domination number in single valued neutrosophic graphs (SVNG) with strong arcs are introduced and analysed in this paper, and some of their properties are studied. The relationship between the neutrosophic secure edge dominance number and its inverse is presented. The concepts inverse neutrosophic total edge domination set and inverse neutrosophic total edge domination number are also defined. Some of these concepts' properties are investigated.

Edge Domination in Web Graph

Let {\ \ \gamma}^e(G) be the edge domination number of a graph. A “web graph” W(s,t) is obtained from the Cartesian product of cycle graph of order s\ and path graph of order\ t. In this paper, edge domination number of the web graph is determined. Mathematical subject classification: 05C69

EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET

As a fundamental research object, the minimum edge dominating set (MEDS) problem is of both theoretical and practical interest. However, determining the size of a MEDS and the number of all MEDSs in a general graph is NP-hard, and it thus makes sense to find special graphs for which the MEDS problem can be exactly solved. In this paper, we study analytically the MEDS problem in the pseudofractal scale-free web and the Sierpiński gasket with the same number of vertices and edges. For both graphs, we obtain exact expressions for the edge domination number, as well as recursive solutions to the number of distinct MEDSs. In the pseudofractal scale-free web, the edge domination number is one-ninth of the number of edges, which is three-fifths of the edge domination number of the Sierpiński gasket. Moreover, the number of all MEDSs in the pseudofractal scale-free web is also less than that corresponding to the Sierpiński gasket. We argue that the difference of the size and number of MEDSs between the two studied graphs lies in the scale-free topology.

A conjecture on the lower bound of the signed edge domination number of 2-connected graphs

In this short note, we construct an infinite family of counterexamples to a conjecture on the lower bound of the signed edge domination number of 2-connected graphs. We propose two problems in order to revise the original conjecture.

The edge-to-edge geodetic domination number of a graph

Let G = (V, E) be a connected graph with at least three vertices. A set S ⊆ E(G) is called an edge-to-edge geodetic dominating set of G if S is both an edge-to-edge geodetic set of G and an edge dominating set of G. The edge-to-edge geodetic domination number γgee(G) of G is the minimum cardinality of its edge-to-edge geodetic dominating sets. Some general properties satisfied by this concept are studied. Connected graphs of size m with edge-to-edge geodetic domination number 2 or m or m − 1 are characterized. We proved that if G is a connected graph of size m ≥ 4 and Ḡ is also connected, then 4 ≤ γgee(G) + γgee(Ḡ) ≤ 2m − 2. Moreover we characterized graphs for which the lower and the upper bounds are sharp. It is shown that, for every pair of positive integers a, b with 2 ≤ a ≤ b, there exists a connected graph G with gee(G) = a and γgee(G) = b. Also it is shown that, for every pair of positive integers a and b with 2 < a ≤ b, there exists a connected graph G with γe(G) = a and γgee(G) = b, where γe(G) is the edge domination number of G and gee(G) is the edge-to-edge geodetic number of G.

Edge domination and 2-independence in trees

An edge dominating set in a graph [Formula: see text] is a subset [Formula: see text] of [Formula: see text] such that each edge in [Formula: see text] is either in [Formula: see text] or adjacent to at least an edge in [Formula: see text]. The edge domination number [Formula: see text] is the minimum cardinality of an edge dominating set in [Formula: see text]. A subset [Formula: see text] of vertices in [Formula: see text] is [Formula: see text]-independent if every vertex of [Formula: see text] has at most one neighbor in [Formula: see text] The [Formula: see text]-independence number [Formula: see text] is the maximum cardinality of a [Formula: see text]-independent set of [Formula: see text] We show that if [Formula: see text] is a nontrivial tree, then [Formula: see text] and we point out that this inequality is not valid for all bipartite graphs. Moreover, we characterize all trees that achieve equality in this bound.

Domination, Edge Domination and Roman Domination in Human Chain Graph

In this paper, we determine domination number, edge domination number and roman domination number of a human chain graph.

Restrained Edge Domination Number of Some Path Related Graphs

For a graph G = (V,E), a set S ⊆ V(S ⊆ E) is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in V - S(E-S). The minimum cardinality of a restrained dominating (restrained edge dominating) set of G is called restrained domination (restrained edge domination) number of G, denoted by γr (G) (γre(G). The restrained edge domination number of some standard graphs are already investigated while in this paper the restrained edge domination number like degree splitting, switching, square and middle graph obtained from path.

Vertex-Edge Roman Domination

A vertex-edge Roman dominating function (or just ve-RDF) of a graph G = (V,E) is a function f : V (G) →{0, 1, 2} such that for each edge e = uv either max{f(u),f(v)}≠0 or there exists a vertex w such that either wu ∈ E or wv ∈ E and f(w) = 2. The weight of a ve-RDF is the sum of its function values over all vertices. The vertex-edge Roman domination number of a graph G, denoted by γveR(G), is the minimum weight of a ve-RDF G. In this paper, we initiate a study of vertex-edge Roman dominaton. We first show that determining the number γveR(G) is NP-complete even for bipartite graphs. Then we show that if T is a tree different from a star with order n, l leaves and s support vertices, then γveR(T) ≥ (n − l − s + 3)∕2, and we characterize the trees attaining this lower bound. Finally, we provide a characterization of all trees with γveR(T) = 2γ′(T), where γ′(T) is the edge domination number of T.

Bounding and approximating minimum maximal matchings in regular graphs

The edge domination number γe(G) of a graph G is the minimum size of a maximal matching in G. It is well known that this parameter is computationally very hard, and several approximation algorithms and heuristics have been studied. In the present paper, we provide best possible upper bounds on γe(G) for regular and non-regular graphs G in terms of their order and maximum degree. Furthermore, we discuss algorithmic consequences of our results and their constructive proofs.