Relevant bibliographies by topics / Graph dominators

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Graph dominators'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 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 'Graph dominators.'

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 "Graph dominators"

1

Zhang, Lei, and Xue Hui Wang. "A Distributed Broadcast Algorithm Based on Master/Slave Dominators for Wireless Mesh Networks." Applied Mechanics and Materials 427-429 (September 2013): 2217–22. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2217.

Full text
Abstract:
We proposed a distributed broadcast algorithm which is based on master/slave dominator partition, it not only guarantees the full coverage of the network, but also has better scalability. In our algorithm, each node first selects its connected domination set (CDS) from its two hop neighbor graph, then partitions the domination nodes into master and slave dominators, master dominators forward the broadcast packet, slave dominators monitor the network coverage and forward the broadcast packet when necessary.
APA, Harvard, Vancouver, ISO, and other styles
2

Dokyeesun, Pakanun, and Chalermpong Worawannotai. "Effect of an edge subdivision on game domination numbers." Asian-European Journal of Mathematics 13, no. 07 (2019): 2050130. http://dx.doi.org/10.1142/s1793557120501302.

Full text
Abstract:
Domination game is a game on a graph [Formula: see text] played by two players called Dominator and Staller. They alternately choose vertices of [Formula: see text] such that each move dominates at least one new undominated vertex. The game ends when all vertices are dominated. Dominator’s goal is to finish the game as soon as possible, while Staller’s goal is to prolong it as much as she can. When Dominator moves first, the game is a Dominator-start game; when Staller moves first, it is a Staller-start game. The game domination numbers [Formula: see text] and [Formula: see text] are the sizes
APA, Harvard, Vancouver, ISO, and other styles
3

Charoensitthichai, Karnchana, and Chalermpong Worawannotai. "Effect of vertex-removal on game total domination numbers." Asian-European Journal of Mathematics 13, no. 07 (2019): 2050129. http://dx.doi.org/10.1142/s1793557120501296.

Full text
Abstract:
The total domination game is played on a graph [Formula: see text] by two players, named Dominator and Staller. They alternately select vertices of [Formula: see text]; each chosen vertex totally dominates its neighbors. In this game, each chosen vertex must totally dominates at least one new vertex not totally dominated before. The game ends when all vertices in [Formula: see text] are totally dominated. Dominator’s goal is to finish the game as soon as possible, and Staller’s goal is to prolong it as much as possible. The game total domination number is the number of chosen vertices when bot
APA, Harvard, Vancouver, ISO, and other styles
4

Panda, B. S., and Arti Pandey. "On the dominator coloring in proper interval graphs and block graphs." Discrete Mathematics, Algorithms and Applications 07, no. 04 (2015): 1550043. http://dx.doi.org/10.1142/s1793830915500433.

Full text
Abstract:
In a graph [Formula: see text], a vertex [Formula: see text] dominates a vertex [Formula: see text] if either [Formula: see text] or [Formula: see text] is adjacent to [Formula: see text]. A subset of vertex set [Formula: see text] that dominates all the vertices of [Formula: see text] is called a dominating set of graph [Formula: see text]. The minimum cardinality of a dominating set of [Formula: see text] is called the domination number of [Formula: see text] and is denoted by [Formula: see text]. A proper coloring of a graph [Formula: see text] is an assignment of colors to the vertices of
APA, Harvard, Vancouver, ISO, and other styles
5

Kavitha, K., N. G. David, and N. Selvi. "Split and Non-Split Dominator Chromatic Numbers and Related Parameters." Mapana - Journal of Sciences 10, no. 1 (2011): 52–62. http://dx.doi.org/10.12723/mjs.18.5.

Full text
Abstract:
A proper graph coloring is defined as coloring the nodes of a graph with the minimum number of colors without any two adjacent nodes having the same color. Dominator coloring of G is a proper coloring in which every vertex of G dominates every vertex of at least one color class. In this paper, new parameters, namely strong split and non-split dominator chromatic numbers and block, cycle, path non-split dominator chromatic numbers are introduced. These parameters are obtained for different classes of graphs and also interesting results are established.
APA, Harvard, Vancouver, ISO, and other styles
6

Pu, Qiang. "Graph Dominations on Some Cubic Graphs." Journal of Computational and Theoretical Nanoscience 13, no. 11 (2016): 8600–8603. http://dx.doi.org/10.1166/jctn.2016.6018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Das, Sayani, and Sounaka Mishra. "Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes." Discrete Mathematics, Algorithms and Applications 12, no. 06 (2020): 2050086. http://dx.doi.org/10.1142/s179383092050086x.

Full text
Abstract:
A [Formula: see text] vertex coloring of a graph [Formula: see text] partitions the vertex set into [Formula: see text] color classes (or independent sets). In minimum vertex coloring problem, the aim is to minimize the number of colors used in a given graph. Here, we consider three variations of vertex coloring problem in which (i) each vertex in [Formula: see text] dominates a color class, (ii) each color class is dominated by a vertex and (iii) each vertex is dominating a color class and each color class is dominated by a vertex. These minimization problems are known as Min-Dominator-Colori
APA, Harvard, Vancouver, ISO, and other styles
8

Klavzar, Sandi, Gasper Kosmrlj, and Simon Schmidt. "On graphs with small game domination number." Applicable Analysis and Discrete Mathematics 10, no. 1 (2016): 30–45. http://dx.doi.org/10.2298/aadm160207003k.

Full text
Abstract:
The domination game is played on a graph G by Dominator and Staller. The game domination number ?(G) of G is the number of moves played when Dominator starts and both players play optimally. Similarly, ?g (G) is the number of moves played when Staller starts. Graphs G with ?(G) = 2, graphs with ?g(G) = 2, as well as graphs extremal with respect to the diameter among these graphs are characterized. In particular, ?g (G) = 2 and diam(G) = 3 hold for a graph G if and only if G is a so-called gamburger. Graphs G with ?(G) = 3 and diam(G) = 6, as well as graphs G with ?g(G) = 3 and diam(G) = 5 are
APA, Harvard, Vancouver, ISO, and other styles
9

R, Kalaivani, and Vijayalakshmi D. "On Dominator Chromatic Number Of Radial Graph Of Some Graphs." Kongunadu Research Journal 6, no. 2 (2019): 1–3. http://dx.doi.org/10.26524/krj293.

Full text
Abstract:
A dominator coloring is a coloring of the vertices of a graph such that every vertex is either alone in its color class or adjacent to all vertices of at least one other class. In this paper, we obtain the Dominator Chromatic number of the Radial graph for the Central graph of Star graph, Super-radial graph for Middle graph of Cycle and Central graph of Path.
APA, Harvard, Vancouver, ISO, and other styles
10

Kalaivani, R., and D. Vijayalakshmi. "On dominator coloring of degree splitting graph of some graphs." Journal of Physics: Conference Series 1139 (December 2018): 012081. http://dx.doi.org/10.1088/1742-6596/1139/1/012081.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graph dominators"

1

Krenz, René. "Graph dominators in logic synthesis and verification." Licentiate thesis, KTH, KTH, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4293.

Full text
Abstract:
<p>This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. Previous algorithms, based on single-vertex dominators suffer from their rare appearance in many circuits. The presented approach searches efficiently for multiple-vertex dominators in circuit graphs. It finds dominator relations, where algorithms for computing single-vertex dominators fail. Another contribution of this thesis is the applicat
APA, Harvard, Vancouver, ISO, and other styles
2

Quesada, Luis. "Solving constrained graph problems using reachability constraints based on transitive closure and dominators / Résolution de problèmes de graphes contraints à l'aide de contraintes d'atteignabilité basées sur la clôture transitive et les dominateurs." Université catholique de Louvain, 2007. http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-11272006-164211/.

Full text
Abstract:
Constrained graph problems are about finding graphs respecting a given set of constraints. These problems occur in many areas. For example, security properties, biological reaction mechanisms, ecological predator/prey relationships, compiler code optimizations, and logic circuit fault diagnosis are just a few of the areas in which graph constraints play an important role. This thesis proposes a constraint programming approach for solving these problems. We present new constraints defined on top of the notions of domination and transitive closure, and their search algorithms. We have implemente
APA, Harvard, Vancouver, ISO, and other styles
3

Krenz-Bååth, René. "Dominator-based Algorithms in Logic Synthesis and Verification." Doctoral thesis, KTH, Elektronik- och datorsystem, ECS, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4579.

Full text
Abstract:
Today's EDA (Electronic Design Automation) industry faces enormous challenges. Their primary cause is the tremendous increase of the complexity of modern digital designs. Graph algorithms are widely applied to solve various EDA problems. In particular, graph dominators, which provide information about the origin and the end of reconverging paths in a circuit graph, proved to be useful in various CAD (Computer Aided Design) applications such as equivalence checking, ATPG, technology mapping, and power optimization. This thesis provides a study on graph dominators in logic synthesis and verifica
APA, Harvard, Vancouver, ISO, and other styles
4

Teslenko, Maxim. "All Around Logic Synthesis." Doctoral thesis, Stockholm : Mikroelektronik och informationsteknik, Kungliga Tekniska högskolan, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4700.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Talon, Alexandre. "Intensive use of computing resources for dominations in grids and other combinatorial problems." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEN079.

Full text
Abstract:
Nous cherchons à prouver de nouveaux résultats en théorie des graphes et combinatoire grâce à la vitesse de calcul des ordinateurs, couplée à des algorithmes astucieux. Nous traitons quatre problèmes. Le théorème des quatre couleurs affirme que toute carte d’un monde où les pays sont connexes peut être coloriée avec 4 couleurs sans que deux pays voisins aient la même couleur. Il a été le premier résultat prouvé en utilisant l'ordinateur, en 1989. Nous souhaitions automatiser encore plus cette preuve. Nous expliquons la preuve et fournissons un programme qui permet de la réétablir, ainsi que d'
APA, Harvard, Vancouver, ISO, and other styles
6

"Solving constrained graph problems using reachability constraints based on transitive closure and dominators / Résolution de problèmes de graphes contraints à l'aide de contraintes d'atteignabilité basées sur la clôture transitive et les dominateurs." Université catholique de Louvain, 2007. http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-11272006-164211/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hsieh, Chi-Yuan, and 謝奇元. "Exploring Intruder Key Trace based on Complicated System Call Graph by Recursive Dominator Mechanism." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/4f28m3.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>資訊工程系<br>107<br>The existing security equipment detects attack by applying host-based intrusion detection system(HIDS), User and Entity Behavior Analytics(UEBA) and anti-virus software. Unfortunately, huge amounts of logs are generated by the equipment, and correlating all of the logs is a very time-consuming task. In the end, only fragments of information are obtained, such as unusual system login behaviors, suspicious Command-and-control(C&C) servers and malware, which are unable to describe the attack scenarios. As a result, forensics experts need to manually investigate t
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph dominators"

1

Henning, Michael A. "Dominator and Total Dominator Colorings in Graphs." In Developments in Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-58892-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chithra, K. P., and Mayamma Joseph. "Total Global Dominator Coloring of Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jeyaseeli, J. Maria, Nazanin Movarraei, and S. Arumugam. "Dominator Coloring of Generalized Petersen Graphs." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Paulraja, P., and K. Raja Chandrasekar. "Dominator Colorings of Products of Graphs." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Akram, Muhammad. "Certain Dominations in m–Polar Fuzzy Graphs." In m−Polar Fuzzy Graphs. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03751-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Arumugam, S., K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh. "Algorithmic Aspects of Dominator Colorings in Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25011-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Murugappan, Mullai. "Dominations in Neutrosophic Graphs." In Advances in Data Mining and Database Management. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1313-2.ch005.

Full text
Abstract:
The aim of this chapter is to impart the importance of domination in various real-life situations when indeterminacy occurs. Domination in graph theory plays an important role in modeling and optimization of computer and telecommunication networks, transportation networks, ad hoc networks and scheduling problems, molecular physics, etc. Also, there are many applications of domination in fuzzy and intuitionistic fuzzy sets for solving problems in vague situations. Domination in neutrosophic graph is introduced in this chapter for handling the situations in case of indeterminacy. Dominating set, minimal dominating set, independent dominating set, and domination number in neutrosophic graph are determined. Some definitions, characterization of independent dominating sets, and theorems of neutrosophic graph are also developed in this chapter.
APA, Harvard, Vancouver, ISO, and other styles
8

Rabuzin, Kornelije, and Martina Šestak. "Graph Database Management Systems." In Encyclopedia of Information Science and Technology, Fifth Edition. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-3479-3.ch053.

Full text
Abstract:
Nowadays, the increased amount and complexity of connected data stimulated by the appearance of social networks has shed a new light on the importance of managing such data, especially handling information about the connections. The most natural way of representing connected data is to represent them as nodes connected with relationships forming a graph. The idea of storing data as a set of nodes and edges comprising a graph was implemented in various forms in data models used in the past. The network data model, developed in late 1960s, can be considered as the first data model, which most accurately incorporated this idea. However, it was not long before the relational data model appeared, and took over the entire database market for years, which it dominates even nowadays. Therefore, the objective of this article is to give a timeline overview of developed graph data storage solutions in order to gain insight into past, present and future trends of GDBMSs. Additionally, the most influential factors and reasons for changes in trends in GDBMSs' usage will be analyzed.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph dominators"

1

Manjula, T., and R. Rajeswari. "Dominator coloring of Quadrilateral Snake, Triangle Snake graph and Barbell graph." In 2016 Second International Conference on Science Technology Engineering And Management (ICONSTEM). IEEE, 2016. http://dx.doi.org/10.1109/iconstem.2016.7560934.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gera, Ralucca. "On the Dominator Colorings in Bipartite Graphs." In 2007 4th International Conference on Information Technology New Generations. IEEE, 2007. http://dx.doi.org/10.1109/itng.2007.142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Agrawal, Hira. "Efficient coverage testing using global dominator graphs." In the 1999 ACM SIGPLAN-SIGSOFT workshop. ACM Press, 1999. http://dx.doi.org/10.1145/316158.316166.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liang, Y. D., C. Rhee, S. K. Dhall, and S. Lakshmivarahan. "NC algorithms for dominations in permutation graphs." In the 1992 ACM/SIGAPP symposium. ACM Press, 1992. http://dx.doi.org/10.1145/130069.130084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Harel, D. "A linear algorithm for finding dominators in flow graphs and related problems." In the seventeenth annual ACM symposium. ACM Press, 1985. http://dx.doi.org/10.1145/22145.22166.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Krenz, René, and Elena Dubrova. "A fast algorithm for finding common multiple-vertex dominators in circuit graphs." In the 2005 conference. ACM Press, 2005. http://dx.doi.org/10.1145/1120725.1120954.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Johnson, Javier N., Eugene Lubarsky, and Ben T. Zinn. "Experimental Investigation of Spray Dynamics Under Jet Engine Augmentor-Like Conditions." In ASME Turbo Expo 2006: Power for Land, Sea, and Air. ASMEDC, 2006. http://dx.doi.org/10.1115/gt2006-91112.

Full text
Abstract:
This paper describes an experimental investigation of fuel spray jet breakup mechanisms when it is injected across the high temperature air flow in low and high pressure jet engine augmentor-like conditions. Phase Doppler particle analyzer data and short exposure pulsed shadow graph images were taken of fuel jet injected into an air cross flow with liquid to air momentum ratios ranging from 5 to 180. Measured droplet diameters taken at atmospheric pressure and a flow Mach number of ∼0.15 show a progressive breakup of the droplets, gradually decreasing in size from 250μm to 150μm and finally to
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!

To the bibliography