Paired Disjunctive Domination Number of Middle Graphs

The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctive domination number in the context of middle graphs, a transformation that captures both adjacency and incidence relations of the original graph. We begin by investigating this parameter for middle graphs of several special graph classes, including path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs, star graphs, friendship graphs, and double star graphs. We then present general results by establishing lower and upper bounds for the paired disjunctive domination number in middle graphs of arbitrary graphs, with particular emphasis on trees. Additionally, we determine the exact value of the parameter for middle graphs obtained through the join operation. These findings contribute to the broader understanding of domination-type parameters in transformed graph structures and offer new insights into their combinatorial behavior.

💡 Research Summary

The paper investigates the paired disjunctive domination number (γᵈ_pr) of middle graphs, a graph transformation that simultaneously incorporates vertices and edges of the original graph. A paired disjunctive dominating set (PDD‑set) is defined as a vertex set D such that (i) every vertex outside D is either adjacent to a vertex of D or has at least two vertices of D at distance two (the “disjunctive” condition), and (ii) the subgraph induced by D contains a perfect matching (the “paired” condition). The minimum cardinality of such a set is denoted γᵈ_pr(G).

The middle graph M(G) of a simple graph G is obtained by subdividing each edge (introducing a new vertex for each edge) and then adding edges between the new vertices whenever the corresponding original edges share an endpoint. Consequently, V(M(G)) = V(G) ∪ E(G) and E(M(G)) consists of the incidence edges (vertex–subdivision vertex) together with the edges of the line graph L(G). This construction captures both adjacency and incidence information, making domination parameters on M(G) distinct from those on G, L(G) or the total graph.

Key contributions:

1. Minimal value 2.
   Theorem 4.1 shows that if G contains two edges sharing a common endpoint, the two corresponding subdivision vertices in M(G) are adjacent and dominate the whole graph in the paired‑disjunctive sense; thus γᵈ_pr(M(G)) = 2. This result is extended in Propositions 4.2 and 4.3 to graphs with a universal vertex (Δ(G)=|V(G)|−1) and to complete bipartite graphs K_{m,n}. Hence many dense graphs have the smallest possible paired‑disjunctive domination number.

2. Exact values for classic families.

   • Cycles Cₙ: Theorem 4.4 proves γᵈ_pr(M(Cₙ)) = 2⌈n/4⌉. The upper bound is achieved by selecting subdivision vertices whose indices are 1 or 2 modulo 4; the lower bound follows from a counting argument on the matching induced by any optimal PDD‑set.
   • Paths Pₙ: Theorem 5 gives a case‑by‑case formula: γᵈ_pr(M(Pₙ)) = 2⌈(n−1)/4⌉ when n ≡ 2,3 (mod 4), and γᵈ_pr(M(Pₙ)) = 2⌈(n−1)/4⌉+2 otherwise. The extra “+2” accounts for the need to dominate the two end‑vertices of the original path.
   • Complete graphs Kₙ and complete bipartite graphs K_{m,n}: Both have γᵈ_pr = 2, as a pair of subdivision vertices corresponding to two incident edges already form a perfect matching that disjunctively dominates the whole middle graph.
   • Stars, friendship graphs, double stars: Similar arguments show that these also attain the value 2 or a small constant, depending on the specific structure.

3. General bounds and trees.
   Using basic observations (γᵈ ≤ γᵈ_pr ≤ γ_pr and 2 ≤ γᵈ_pr ≤ |V|), the authors establish that for any isolate‑free graph G, 2 ≤ γᵈ_pr(M(G)) ≤ |V(M(G))|. For trees, they exploit the role of support vertices and leaves: any PDD‑set must contain each support vertex together with a neighbor, or at least two neighbors of the support vertex. This yields a lower bound proportional to the number of leaves, e.g., γᵈ_pr(M(T)) ≥ 2⌈|Leaf(T)|/4⌉, strengthening the generic bound for acyclic graphs.

4. Join operation.
   The paper studies the graph join G+H (all vertices of G become adjacent to all vertices of H). Because the join creates many new edges, the middle graph M(G+H) always contains a pair of subdivision vertices that are adjacent and dominate the rest. Consequently, γᵈ_pr(M(G+H)) = min{γᵈ_pr(M(G)), γᵈ_pr(M(H)), 2}. This result shows that the join operation never increases the paired‑disjunctive domination number beyond 2.

Methodology:
The authors rely heavily on constructive proofs. For upper bounds they explicitly construct candidate PDD‑sets (often by selecting subdivision vertices with a regular pattern). For lower bounds they analyze the structure of any optimal PDD‑set, focusing on the induced perfect matching and the distance‑two domination requirement, and then use counting arguments to show that a certain number of matched pairs is unavoidable.

Strengths:

• Introduces a novel combination of two recent domination concepts (paired and disjunctive) within the less‑explored context of middle graphs.
• Provides exact formulas for several fundamental graph families, which serve as benchmarks for future work.
• The sufficient condition for γᵈ_pr = 2 (existence of two incident edges) is simple yet powerful, covering many dense graphs.
• The treatment of the join operation yields a clean, easily applicable formula.

Weaknesses and open problems:

• The paper does not address algorithmic aspects; the computational complexity of determining γᵈ_pr(M(G)) for arbitrary G remains open.
• For general graphs, the provided bounds are relatively loose; tighter, perhaps parameter‑dependent bounds (e.g., in terms of treewidth, maximum degree, or domination number of G) are not explored.
• No experimental validation or real‑world case studies are presented, limiting insight into practical applicability.
• The paper focuses on exact values for highly symmetric families; intermediate families (e.g., grids, hypercubes) are omitted.
• The relationship between γᵈ_pr(M(G)) and other domination parameters on G (such as γ(G), γ_pr(G), γ_d(G)) could be investigated more deeply.

Future directions suggested by the authors and inferred:

1. Complexity analysis: Determine whether computing γᵈ_pr(M(G)) is NP‑complete and identify tractable graph classes (e.g., bounded treewidth, chordal graphs).
2. Approximation algorithms: Design polynomial‑time approximation schemes or constant‑factor heuristics for large networks.
3. Parameter‑ized algorithms: Develop FPT algorithms with respect to parameters like Δ(G), domination number, or the size of a minimum vertex cover.
4. Comparative study: Analyze γᵈ_pr on other graph transformations (line graph, total graph, subdivision graph) to understand the effect of different structural augmentations.
5. Applications: Model fault‑tolerant facility location or emergency‑service placement problems using the paired‑disjunctive framework on middle graphs, evaluating cost‑reliability trade‑offs.

In summary, the paper establishes foundational results on the paired disjunctive domination number of middle graphs, delivering exact values for several classic families, general bounds for arbitrary graphs and trees, and a concise formula for the join operation. While the theoretical contributions are solid, further work is needed to address algorithmic complexity, tighter bounds for broader classes, and practical applications.