The edge-vertex domination and weighted edge-vertex domination problem

Peng Li (), Xinyi Xue () and Xingli Zhou ()
Additional contact information
Peng Li: Chongqing University of Technology
Xinyi Xue: Chongqing University of Technology
Xingli Zhou: Chongqing University of Technology

Journal of Combinatorial Optimization, 2025, vol. 49, issue 2, No 13, 9 pages

Abstract: Abstract Consider a simple (edge weighted) graph $$G = \left( {V,E} \right)$$ G = V , E with $$\left| V \right| = n$$ V = n and $$\left| E \right| = m$$ E = m . Let $$xy \in E$$ x y ∈ E . The domination of a vertex $$z \in V$$ z ∈ V by an edge $$xy$$ xy is defined as $$z$$ z belonging to the closed neighborhood of either $$x$$ x or $$y$$ y . An edge set $$W$$ W is considered as an edge-vertex dominating set of $$G$$ G if each vertex of $$V$$ V is dominated by some edge of $$W$$ W . The (weighted) edge-vertex domination problem aims to find an edge-vertex dominating set of $$G$$ G with the minimum cardinality. Let $$M \subseteq V$$ M ⊆ V and $$N \subseteq E$$ N ⊆ E . Given a positive integer $$p$$ p , if a vertex $$z$$ z is dominated by $$p$$ p edges in set $$N$$ N , then set $$N$$ N is called a $$p$$ p edge-vertex dominating set of graph $$G$$ G with respect to $$M$$ M . This study investigates the edge-vertex domination problem and the $$p$$ p edge-vertex domination problem, presents an algorithm with a time complexity of $$O\left( {nm^{2} } \right)$$ O n m 2 for solving the weighted edge-vertex domination problem on unit interval graphs. Moreover, algorithms have been developed with time complexities of $$O\left( {m\lg m + p\left| M \right| + n} \right)$$ O m lg m + p M + n and $$O\left( {n\left| M \right|} \right)$$ O n M for identifying a minimum $$p$$ p edge-vertex dominating set of an interval graph $$G$$ G and a tree $$T$$ T , respectively, with respect to any subset $$M \subseteq V$$ M ⊆ V .

Keywords: Weighted edge-vertex domination; Edge-vertex domination; $$p$$ p edge-vertex domination; Unit interval graphs; Interval graphs; Trees (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01263-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:2:d:10.1007_s10878-025-01263-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01263-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().