Results 21 to 30 of about 263,414 (258)
Coloring, location and domination of corona graphs [PDF]
, 2012 A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a ...
Aguilar, A. Rondón +2 more
core +4 more sources
JTAM (Jurnal Teori dan Aplikasi Matematika), 2022 The study purpose is to determine the four-distance domination number in the amalgamation operation graph, namely the vertex amalgamation result graph of ladder graph Amal(L_m,v,n) with m≥2 and n≥2 and the vertex amalgamation result graph of a star graph
Ilham Saifudin +2 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2013 For any graph G=(V,E), a subset S⊆V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). For any positive integer k, a general k-distance domination function of a graph G is a function f:V→{0,1,…,k} such that every vertex with ...
Elliot Krop, Tony Yaacoub
openaire +1 more source
Graph Domination in Distance Two
Discussiones Mathematicae Graph Theory, 2005 A subgraph \(D\) of a graph \(G\) is \(k\)-dominating in \(G\) if every vertex of \(G-D\) is of distance \(\leq k\) from a vertex of \(D\). If \(\mathcal D\) is a specified class of graphs, Dom\(_k \mathcal D\) consists of all those graphs \(G\) in which every connected induced subgraph \(H\) has a \(k\)-dominating induced subgraph \(D \in {\mathcal D}\
Bacsó, Gábor +2 more
openaire +2 more sources
Hop total Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 In this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 there exists ...
H. Abdollahzadeh Ahangar +3 more
doaj +1 more source
Approximate Comparison of Functions Computed by Distance Automata [PDF]
, 2015 Distance automata are automata weighted over the semiring (N∪{∞},min,+) (the tropical semiring). Such automata compute functions from words to N∪{∞}. It is known from Krob that the problems of deciding ‘ f≤g’ or ‘ f=g’ for f and g computed by distance ...
Colcombet, T., Daviaud, L.
core +1 more source
Distributed Dominating Sets on Grids [PDF]
, 2013 This paper presents a distributed algorithm for finding near optimal dominating sets on grids. The basis for this algorithm is an existing centralized algorithm that constructs dominating sets on grids.
Fata, Elaheh +2 more
core +1 more source
Average distances and distance domination numbers
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tian, Fang, Xu, Jun-Ming
openaire +2 more sources
Discussiones Mathematicae Graph Theory, 2021 In this paper, we study a new distance parameter triameter of a connected graph G, which is defined as max{d(u; v)+d(v;w)+d(u;w) : u; v;w ∈ V }and is denoted by tr(G).
Das Angsuman
doaj +1 more source
Approximate comparison of distance automata [PDF]
, 2012 Distance automata are automata weighted over the semiring (N∪ {∞}, min,+) (the tropical semiring). Such automata compute functions from words to N ∪{∞} such as the number of occurrences of a given letter.
Colcombet, T., Daviaud, L.
core +4 more sources