Log in

Relevant bibliographies by topics / Neighborhood total domination

Contents

Journal articles
Book chapters
Conference papers

Academic literature on the topic 'Neighborhood total domination'

Author: Grafiati

Published: 3 June 2025

Last updated: 6 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Neighborhood total domination.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Neighborhood total domination"

1

Hassan, Javier, and Sergio R. Canoy, Jr. "Grundy Total Hop Dominating Sequences in Graphs." European Journal of Pure and Applied Mathematics 16, no. 4 (2023): 2597–612. http://dx.doi.org/10.29020/nybg.ejpam.v16i4.4877.

Full text

Abstract:

Let G = (V (G), E(G)) be an undirected graph with γ(C) ̸= 1 for each component C of G. Let S = (v1, v2, · · · , vk) be a sequence of distint vertices of a graph G, and let Sˆ ={v1, v2, . . . , vk}. Then S is a legal open hop neighborhood sequence if N2G(vi) \Si−1j=1 N2G(vj ) ̸= ∅for every i ∈ {2, . . . , k}. If, in addition, Sˆ is a total hop dominating set of G, then S is a Grundy total hop dominating sequence. The maximum length of a Grundy total hop dominating sequence in a graph G, denoted by γth gr(G), is the Grundy total hop domination number of G. In this paper, we show that the Grundy total hop domination number of a graph G is between the total hop domination number and twice the Grundy hop domination number of G. Moreover, determine values or bounds of the Grundy total hop domination number of some graphs.

APA, Harvard, Vancouver, ISO, and other styles

2

Sivagnanam, C. "Neighborhood Total Domination and Colouring in Graphs." International Journal of Mathematics and Soft Computing 5, no. 1 (2015): 143. http://dx.doi.org/10.26708/ijmsc.2015.1.5.16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Kan, Changhong Lu, and Bing Wang. "Bounds on Neighborhood Total Domination Numberin Graphs." Bulletin of the Iranian Mathematical Society 45, no. 4 (2019): 1135–43. http://dx.doi.org/10.1007/s41980-018-0189-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Henning, Michael A., and Nader Jafari Rad. "Bounds on neighborhood total domination in graphs." Discrete Applied Mathematics 161, no. 16-17 (2013): 2460–66. http://dx.doi.org/10.1016/j.dam.2013.05.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Henning, Michael A., and Kirsti Wash. "Trees with large neighborhood total domination number." Discrete Applied Mathematics 187 (May 2015): 96–102. http://dx.doi.org/10.1016/j.dam.2015.01.037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

RAD, NADER JAFARI. "A note on neighborhood total domination in graphs." Proceedings - Mathematical Sciences 125, no. 3 (2015): 271–76. http://dx.doi.org/10.1007/s12044-015-0241-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lee, Chuan-Min. "Exploring Dominating Functions and Their Complexity in Subclasses of Weighted Chordal Graphs and Bipartite Graphs." Mathematics 13, no. 3 (2025): 403. https://doi.org/10.3390/math13030403.

Full text

Abstract:

Domination problems are fundamental problems in graph theory with diverse applications in optimization, network design, and computational complexity. This paper investigates {k}-domination, k-tuple domination, and their total domination variants in weighted strongly chordal graphs and chordal bipartite graphs. Specifically, the {k}-domination problem in weighted strongly chordal graphs and the total {k}-domination problem in weighted chordal bipartite graphs are shown to be solvable in O(n+m) time. For weighted proper interval graphs and convex bipartite graphs, we solve the k-tuple domination and total k-tuple domination problems in O(n2.371552log2(n)log(n/δ)), where δ is the desired accuracy. Furthermore, for weighted unit interval graphs, the k-tuple domination problem achieves a significant complexity improvement, reduced from O(nk+2) to O(n2.371552log2(n)log(n/δ)). These results are achieved through a combination of linear and integer programming techniques, complemented by totally balanced matrices, totally unimodular matrices, and graph-specific matrix representations such as neighborhood and closed neighborhood matrices.

APA, Harvard, Vancouver, ISO, and other styles

8

Sheikholeslami, Seyed Mahmoud, and Lutz Volkmann. "Outer independent total double Italian domination number." Computer Science Journal of Moldova 32, no. 1(94) (2024): 19–37. http://dx.doi.org/10.56415/csjm.v32.02.

Full text

Abstract:

If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3$ for every vertex $u\in V(G)$ with $f(u)\in\{0,1\}$ and (ii) the subgraph induced by the vertices with a non-zero label has no isolated vertices. A TDIDF is an outer-independent total double Italian dominating function (OITDIDF) on $G$ if the set of vertices labeled $0$ induces an edgeless subgraph. The weight of an OITDIDF is the sum of its function values over all vertices, and the outer independent total double Italian domination number $\gamma_{tdI}^{oi}(G)$ is the minimum weight of an OITDIDF on $G$. In this paper, we establish various bounds on $\gamma_{tdI}^{oi}(G)$, and we determine this parameter for some special classes of graphs.

APA, Harvard, Vancouver, ISO, and other styles

9

Jha, Anupriya, D. Pradhan, and S. Banerjee. "Algorithm and hardness results on neighborhood total domination in graphs." Theoretical Computer Science 840 (November 2020): 16–32. http://dx.doi.org/10.1016/j.tcs.2020.05.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lu, Changhong, Bing Wang та Kan Wang. "Algorithm complexity of neighborhood total domination and $$(\rho ,\gamma _{nt})$$ ( ρ , γ n t ) -graphs". Journal of Combinatorial Optimization 35, № 2 (2017): 424–35. http://dx.doi.org/10.1007/s10878-017-0181-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Neighborhood total domination"

1

Casado, Alejandra, Jesús Sánchez-Oro, Anna Martínez-Gavara, and Abraham Duarte. "Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem." In Metaheuristics. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-62912-9_36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Motair, Hafed. "An Insertion Procedure to Solve Hybrid Multiobjective Permutation Flowshop Scheduling Problems." In Mastering Time - Innovative Solutions to Complex Scheduling Problems [Working Title]. IntechOpen, 2025. https://doi.org/10.5772/intechopen.1006829.

Full text

Abstract:

This paper presents an insertion procedure (IP) that can be used to improve the performance of multiobjective scheduling problems (MOSPs) algorithms. The proposed procedure uses variable neighborhood search (VNS) combined with an insertion method, which can be adapted to any MOSP, whether heuristic or metaheuristic. The aim is to solve 2-machine permutation flowshop scheduling problem (PFSP) and minimize two objective functions simultaneously: Maximum completion time (makespan) and total completion times (∑jCj) (TCT) in order to find the efficient (non dominated) solutions. The proposed IP is combined with two algorithms from the literature, the non dominated sorting genetic algorithm (NSGA-2) and the multiobjective partial enumeration algorithm (MOPE), the objective is to explore more non dominating solution by the use of insertion concept of jobs through all possible positions of the considered sequence. To evaluate the algorithms, a large set of test instances involving up to 80 jobs was used for our investigation. We found that using the IP procedure is very useful in improving the performance of multiobjective algorithms and that the proposal was very useful in producing good solutions compared to the original algorithms, as it used to improve the performance of both MOPE and MOGA.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Neighborhood total domination"

1

Anjaline, W., and A. Stanis Arul Mary. "Minimum neighborhood total domination of some graphs." In INTERNATIONAL CONFERENCE ON EMERGING TRENDS IN ELECTRONICS AND COMMUNICATION ENGINEERING - 2023. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0212064.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kahat, Sahib S. H., and Manal N. Al-Harere. "Total equality Co-neighborhood domination in a graph." In INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING ICCMSE 2021. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0114832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!