Log in

Relevant bibliographies by topics / K-dominating set

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'K-dominating set'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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 'K-dominating set.'

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 "K-dominating set"

1

SHEIKHOLESLAMI, S. M., and L. VOLKMANN. "SIGNED TOTAL {K}-DOMINATION AND {K}-DOMATIC NUMBERS OF GRAPHS." Discrete Mathematics, Algorithms and Applications 04, no. 01 (2012): 1250006. http://dx.doi.org/10.1142/s1793830912500061.

Full text

Abstract:

Let k be a positive integer, and let G be a simple graph with vertex set V(G). A function f : V(G) → {±1, ±2, …, ±k} is called a signed total {k}-dominating function if ∑u∈N(v) f(u) ≥ k for each vertex v ∈ V(G). A set {f1, f2, …, fd} of signed total {k}-dominating functions on G with the property that [Formula: see text] for each v∈V(G), is called a signed total {k}-dominating family (of functions) on G. The maximum number of functions in a signed total {k}-dominating family on G is the signed total {k}-domatic number of G, denoted by [Formula: see text]. Note that [Formula: see text] is the c

APA, Harvard, Vancouver, ISO, and other styles

2

Bent-Usman, Wardah Masanggila, and Rowena T. Isla. "On k-Fair Total Domination in Graphs." European Journal of Pure and Applied Mathematics 14, no. 2 (2021): 578–89. http://dx.doi.org/10.29020/nybg.ejpam.v14i2.3967.

Full text

Abstract:

Let G = (V (G), E(G)) be a simple non-empty graph. For an integer k ≥ 1, a k-fairtotal dominating set (kf td-set) is a total dominating set S ⊆ V (G) such that |NG(u) ∩ S| = k for every u ∈ V (G)\S. The k-fair total domination number of G, denoted by γkf td(G), is the minimum cardinality of a kf td-set. A k-fair total dominating set of cardinality γkf td(G) is called a minimum k-fair total dominating set or a γkf td-set. We investigate the notion of k-fair total domination in this paper. We also characterize the k-fair total dominating sets in the join, corona, lexicographic product and Cartes

APA, Harvard, Vancouver, ISO, and other styles

3

Barman, Sambhu Charan, Madhumangal Pal, and Sukumar Mondal. "An optimal algorithm to find minimum k-hop dominating set of interval graphs." Discrete Mathematics, Algorithms and Applications 11, no. 02 (2019): 1950016. http://dx.doi.org/10.1142/s1793830919500162.

Full text

Abstract:

For a fixed positive integer [Formula: see text], a [Formula: see text]-hop dominating set [Formula: see text] of a graph [Formula: see text] is a subset of [Formula: see text] such that every vertex [Formula: see text] is within [Formula: see text]-steps from at least one vertex [Formula: see text], i.e., [Formula: see text]. A [Formula: see text]-hop dominating set [Formula: see text] is said to be minimal if there does not exist any [Formula: see text] such that [Formula: see text] is a [Formula: see text]-hop dominating set of G. A dominating set [Formula: see text] is said to be minimum [

APA, Harvard, Vancouver, ISO, and other styles

4

Abdollahzadeh Ahangar, H., D. A. Mojdeh, A. Sayed-Khalkhali, and V. Samodivkin. "Efficient k-Distance Dominating Set in Cayley Graphs." Proceedings of the National Academy of Sciences, India Section A: Physical Sciences 90, no. 1 (2018): 141–47. http://dx.doi.org/10.1007/s40010-018-0539-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hernández Mira, Frank A., Ernesto Parra Inza, José M. Sigarreta Almira, and Nodari Vakhania. "Properties of the Global Total k-Domination Number." Mathematics 9, no. 5 (2021): 480. http://dx.doi.org/10.3390/math9050480.

Full text

Abstract:

A nonempty subset D⊂V of vertices of a graph G=(V,E) is a dominating set if every vertex of this graph is adjacent to at least one vertex from this set except the vertices which belong to this set itself. D⊆V is a total k-dominating set if there are at least k vertices in set D adjacent to every vertex v∈V, and it is a global total k-dominating set if D is a total k-dominating set of both G and G¯. The global total k-domination number of G, denoted by γktg(G), is the minimum cardinality of a global total k-dominating set of G, GTkD-set. Here we derive upper and lower bounds of γktg(G), and dev

APA, Harvard, Vancouver, ISO, and other styles

6

Abdul Gafur, Anuwar Kadir, and Suhadi Wido Saputro. "On Locating-Dominating Set of Regular Graphs." Journal of Mathematics 2021 (September 24, 2021): 1–6. http://dx.doi.org/10.1155/2021/8147514.

Full text

Abstract:

Let G be a simple, connected, and finite graph. For every vertex v ∈ V G , we denote by N G v the set of neighbours of v in G . The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ V G such that every two distinct vertices u , v ∈ V G \ W satisfies ∅ ≠ N G u ∩ W ≠ N G v ∩ W ≠ ∅ . A graph G is called k -regular graph if every vertex of G is adjacent to k other vertices of G . In this paper, we determine the locating-dominating number of k -regular graph of order n , where k = n − 2 or k = n − 3 .

APA, Harvard, Vancouver, ISO, and other styles

7

ZHANG, ZHAO, QINGHAI LIU, and DEYING LI. "TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET." Discrete Mathematics, Algorithms and Applications 01, no. 04 (2009): 485–98. http://dx.doi.org/10.1142/s1793830909000361.

Full text

Abstract:

A vertex set D of a connected graph G is a (k, r)-connected dominating set ((k, r)-CDS) if every vertex in V(G)\D is at most r-hops away from at least k vertices in D. Finding a minimum (k, r)-CDS has wireless sensor network as its background. In this paper, we give two approximation algorithms to compute a minimum (k, r)-CDS, which improves previous works in regard of performance ratio.

APA, Harvard, Vancouver, ISO, and other styles

8

Argiroffo, Gabriela R., Maria E. Ugarte, and Mariana S. Escalante. "On the k-dominating set polytope of web graphs." Electronic Notes in Discrete Mathematics 36 (August 2010): 1161–68. http://dx.doi.org/10.1016/j.endm.2010.05.147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Yao, Xiaopeng, Hejiao Huang, and Hongwei Du. "Connected positive influence dominating set in k-regular graph." Discrete Applied Mathematics 287 (December 2020): 65–76. http://dx.doi.org/10.1016/j.dam.2020.08.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hansen, Jennie C., Eric Schmutz, and Li Sheng. "The Expected Size of the Rule k Dominating Set." Algorithmica 46, no. 3-4 (2006): 409–18. http://dx.doi.org/10.1007/s00453-006-0104-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "K-dominating set"

1

Coelho, Rafael Santos. "The k-hop connected dominating set problem: approximation algorithms and hardness results." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/.

Full text

Abstract:

Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is connected, and for every vertex v in G, there is a vertex u in D such that the distance between v and u in G is at most k. We study the problem of finding a minimum k-hop connected dominating set of a graph (Mink-CDS). We prove that Mink-CDS is NP-hard on planar bipartite graphs of maximum degree 4. We also prove that Mink-CDS is APX-complete on bipartite graphs of maximum degree 4. We present inapproximability thresholds for Mink-CDS on bipar-

APA, Harvard, Vancouver, ISO, and other styles

2

Cao, Guangtong. "Distributed services for mobile ad hoc networks." Texas A&M University, 2005. http://hdl.handle.net/1969.1/2541.

Full text

Abstract:

A mobile ad hoc network consists of certain nodes that communicate only through wireless medium and can move arbitrarily. The key feature of a mobile ad hoc network is the mobility of the nodes. Because of the mobility, communication links form and disappear as nodes come into and go out of each other's communica- tion range. Mobile ad hoc networks are particularly useful in situations like disaster recovery and search, military operations, etc. Research on mobile ad hoc networks has drawn a huge amount of attention recently. The main challenges for mobile ad hoc networks are the sparse resour

APA, Harvard, Vancouver, ISO, and other styles

3

Beggas, Fairouz. "Decomposition and Domination of Some Graphs." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE1051.

Full text

Abstract:

La théorie des graphes est considérée comme un vaste champ qui permet d'explorer différentes techniques de preuve des mathématiques discrètes. Ainsi, les différents problèmes traités dans cette théorie ont plein d'applications dans d'autres domaines scientifiques tels que l'informatique, la physique, la sociologie, la théorie des jeux, etc. Dans cette optique, nous proposons, dans cette thèse, de mettre l'accent sur trois problèmes de graphes, à savoir la multidécomposition de multigraphes, la [1, 2]-domination et le monitoring des arêtes. Ainsi, le fait d'explorer, dans ce travail de thèse, t

APA, Harvard, Vancouver, ISO, and other styles

4

Rivierre, Yvan. "Algorithmes auto-stabilisants pour la construction de structures couvrantes réparties." Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM089/document.

Full text

Abstract:

Cette thèse s'intéresse à la construction auto-stabilisante de structures couvrantes dans un système réparti. L'auto-stabilisation est un paradigme pour la tolérance aux fautes dans les algorithmes répartis. Plus précisément, elle garantit que le système retrouve un comportement correct en temps fini après avoir été perturbé par des fautes transitoires. Notre modèle de système réparti se base sur des mémoires localement partagées pour la communication, des identifiants uniques pour briser les symétries et un ordonnanceur inéquitable, c'est-à-dire le plus faible des ordonnanceurs. Dans la mesur

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Chih-Yuan, and 陳志遠. "Self-stabilizing Algorithms for the Minimal k-dominating Set Problem for k=1 or 2." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/48625396289785534798.

Full text

Abstract:

博士<br>元智大學<br>資訊工程學系<br>95<br>Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. The self-stabilizing property makes the algorithm capable of handling error recovery automatically. A self-stabilizing system is more robust than a traditional fault-tolerance system in the face of transient fault, a fault that only perturbs the system state, but not the program code. The notion of self-stabilization was first introduced in Dijkstra’s pioneering paper in 1974. According to Dijkstra’s original idea, a distributed algorithm is self-stabilizing if, r

APA, Harvard, Vancouver, ISO, and other styles

6

Hung, Hao-Hsiang, and 洪浩翔. "Constructing and Maintaining a Connected k-hop Dominating Set in Mobile Ad Hoc Networks." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/47639529569080188365.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>92<br>In a graph G = (V,E), a k-hop dominating set Dk is a subset of such that all nodes in V are either in or at most k-hop to a node Dk. A k-hop dominating set Dk is connected if there is a path, in which each node is in Dk, between any two nodes in Dk. In a mobile ad hoc network, a node communicates with its neighbors by sending messages across channels, and the others by routing messages via the network. The hierarchical routing protocol that constructs and maintains a connected k-hop dominating set attempts to reduce transmission power and communication overhead.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "K-dominating set"

1

Kamath, S. S., A. Senthil Thilak, and Rashmi M. "Relation Between k-DRD and Dominating Set." In Trends in Mathematics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01123-9_56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Banerjee, Sandip, and Sujoy Bhore. "Algorithm and Hardness Results on Liar’s Dominating Set and $$\varvec{k}$$ -tuple Dominating Set." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25005-8_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Guangyuan, Hua Wang, Xiaohui Tao, Ji Zhang, and Jinhua Zhang. "Minimising K-Dominating Set in Arbitrary Network Graphs." In Advanced Data Mining and Applications. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-53917-6_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Johnen, Colette. "Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction." In Lecture Notes in Computer Science. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03089-0_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Johnen, Colette. "Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction." In Networked Systems. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26850-7_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Frankiewicz, Artur, Adam Glos, Krzysztof Grochla, et al. "LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm." In Modelling, Analysis, and Simulation of Computer and Telecommunication Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68110-4_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Basuchowdhuri, Partha, and Subhashis Majumder. "Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set." In Applied Algorithms. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04126-1_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Miranda, Pedro, and Michel Grabisch. "Finding the Set of k-additive Dominating Measures Viewed as a Flow Problem." In Information Processing and Management of Uncertainty in Knowledge-Based Systems. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40596-4_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Czygrinow, Andrzej, Michal Hanćkowiak, Edyta Szymańska, Wojciech Wawrzyniak, and Marcin Witkowski. "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14472-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Guangyuan, Hua Wang, Xiaohui Tao, and Ji Zhang. "A Self-stabilizing Algorithm for Finding a Minimal K-Dominating Set in General Networks." In Data and Knowledge Engineering. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34679-8_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "K-dominating set"

1

Xing, Kai, Wei Cheng, E. K. Park, and Shmuel Rotenstreich. "Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs." In 2008 28th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, 2008. http://dx.doi.org/10.1109/icdcs.2008.39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Harutyunyan, Louisa, and Lata Narayanan. "Minimum 2-connected distance-k p-dominating set in wireless sensor networks." In 2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob). IEEE, 2012. http://dx.doi.org/10.1109/wimob.2012.6379076.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Li, Yefang, Tianping Shuai, and Wenbao Ai. "Construction of 1- and 2-Connected k-Totally Dominating Set in Disk Graph." In 2011 Fourth International Joint Conference on Computational Sciences and Optimization (CSO). IEEE, 2011. http://dx.doi.org/10.1109/cso.2011.110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Jiahong, Yuhiro Yonamine, Eiichiro Kodama, and Toyoo Takata. "A Distributed Approach to Constructing k-Hop Connected Dominating Set in Ad Hoc Networks." In 2013 International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2013. http://dx.doi.org/10.1109/icpads.2013.57.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Yun, Kai Li, and Qiang Xu. "A Distributed Topology Control Algorithm for k-Connected Dominating Set in Wireless Sensor Networks." In 2007 2nd International Conference on Pervasive Computing and Applications. IEEE, 2007. http://dx.doi.org/10.1109/icpca.2007.4365521.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Fu, Yongsheng, Xinyu Wang, and Shanping Li. "Construction K-Dominating Set with Multiple Relaying Technique in Wireless Mobile Ad Hoc Networks." In 2009 WRI International Conference on Communications and Mobile Computing (CMC). IEEE, 2009. http://dx.doi.org/10.1109/cmc.2009.58.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Moulahi, Tarek, Herve Guyennet, Salem Nasri, and Rjab Hajlaoui. "On the construction of load-balanced (k, r-hop)-connected dominating set for WSNs." In 2012 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS). IEEE, 2012. http://dx.doi.org/10.1109/ants.2012.6524232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Tiwari, Ravi, Tania Mishra, Yingshu Li, and My T. Thai. "k-Strongly Connected m-Dominating and Absorbing Set in Wireless Ad Hoc Networks with Unidirectional Links." In 2007 International Conference on Wireless Algorithms, Systems and Applications. IEEE, 2007. http://dx.doi.org/10.1109/wasa.2007.25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Santoso, Bagus Jati, Vynska Amalia Permadi, Tohari Ahmad, Royyana Muslim Ijtihadie, and Bayu Sektiaji. "Continuous Top-k Dominating Query of Incomplete Data over Data Streams." In 2018 International Conference on Sustainable Information Engineering and Technology (SIET). IEEE, 2018. http://dx.doi.org/10.1109/siet.2018.8693162.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Guo, Strong, Hua Chen, Xiaocheng Zhu, and Zhaohui Du. "Numerical Simulation of Surge in Turbocharger Centrifugal Compressor: Influences of Downstream Plenum." In ASME 2011 Turbo Expo: Turbine Technical Conference and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/gt2011-45163.

Full text

Abstract:

Surge is an important instability seriously affecting compression systems. This paper presents a numerical simulation of surge flow phenomenon inside a turbocharger centrifugal compressor with a vaneless diffuser. The compressor was discharged into a plenum and the effect of the plenum on surge behavior of the compressor system was investigated. The entire geometry of the compressor, including the impeller, vaneless diffuser, volute housing and downstream plenum, were included in the simulation. Three-dimensional Reynolds averaged compressible Navier–Stokes equations were solved with the k–ε t

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!