Results 51 to 60 of about 197 (101)
A Note on Roman Domination of Digraphs
Discussiones Mathematicae Graph Theory, 2019 A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S is adjacent from at least one vertex in S. The domination number of a digraph D, denoted by γ(D), is the minimum cardinality of a dominating set of D.
Chen Xiaodan, Hao Guoliang, Xie Zhihong
doaj +1 more source
The Double Roman Domatic Number of a Digraph
Discussiones Mathematicae Graph Theory, 2020 A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +1 more source
Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code
Discussiones Mathematicae Graph Theory, 2021 A (1, ≤ ℓ)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ℓ have distinct closed in-neighbourhoods within C. In this paper, we give some sufficient conditions for a digraph
Balbuena Camino +2 more
doaj +1 more source
Bulletin of Symbolic Logic, 2018 prepared by Zanyar A. Ameen and Mirna Džamonja E-mail: zanyar@uod.ac URL: https://ueaeprints.uea.ac.uk/56864/1/2015AmeenZAPhD.pdf MichealPawliuk,Amenability andUniqueErgodicity of theAutomorphismGroups of all Countable Homogeneous Directed Graphs ...
Phillip R. Wesolek
semanticscholar +1 more source
On characteristic and permanent polynomials of a matrix
Special Matrices, 2017 There is a digraph corresponding to every square matrix over ℂ. We generate a recurrence relation using the Laplace expansion to calculate the characteristic and the permanent polynomials of a square matrix.
Singh Ranveer, Bapat R. B.
doaj +1 more source
Bulletin of Symbolic Logic, 2018 prepared by Zanyar A. Ameen and Mirna Džamonja E-mail: zanyar@uod.ac URL: https://ueaeprints.uea.ac.uk/56864/1/2015AmeenZAPhD.pdf MichealPawliuk,Amenability andUniqueErgodicity of theAutomorphismGroups of all Countable Homogeneous Directed Graphs ...
M. Pawliuk
semanticscholar +1 more source
On kernels by rainbow paths in arc-coloured digraphs
Open Mathematics, 2021 In 2018, Bai, Fujita and Zhang [Discrete Math. 341 (2018), no. 6, 1523–1533] introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph DD, which is a subset SS of vertices of DD such that (aa) there exists no ...
Li Ruijuan, Cao Yanqin, Zhang Xinhong
doaj +1 more source
The (1, 2)-step competition graph of a hypertournament
Open Mathematics, 2021 In 2011, Factor and Merz [Discrete Appl. Math. 159 (2011), 100–103] defined the (1,2)\left(1,2)-step competition graph of a digraph. Given a digraph D=(V,A)D=\left(V,A), the (1,2)\left(1,2)-step competition graph of D, denoted C1,2(D){C}_{1,2}\left(D ...
Li Ruijuan, An Xiaoting, Zhang Xinhong
doaj +1 more source
Path homology theory of edge-colored graphs
Open Mathematics, 2021 In this paper, we introduce the category and the homotopy category of edge-colored digraphs and construct the functorial homology theory on the foundation of the path homology theory provided by Grigoryan, Muranov, and Shing-Tung Yau.
Muranov Yuri V., Szczepkowska Anna
doaj +1 more source
ANOTHER STEP TOWARDS DETERMINING THE HIT NUMBER OF SUBDIVIDED STARS
, 2018 A total-coloring c of a directed graph G is called edge-distinguishing if for any two edges e1 = u1v1 and e2 = u2v2 of G the associated ordered triplets (c(u1), c(e1), c(v1)) and (c(u2), c(e2), c(v2)) are different.
J. Bucko, J. Czap
semanticscholar +1 more source