Results 41 to 50 of about 8,914 (221)
On Relations between Neighborhoods of Threshold and Ferrers Digraphs
Journal of Graph Algorithms and ApplicationsFerrers digraphs have linearly nested in- and out-neighborhoods that define two rankings on the vertices. Removing the loops turns Ferrers into threshold digraphs in which the neighborhoods are no longer nested in general.
Gordana Marmulla, Ulrik Brandes
doaj +1 more source
More skew-equienergetic digraphs
Communications in Combinatorics and Optimization, 2016 Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices.
Ch. Adiga +1 more
doaj +1 more source
Efficient Open Domination in Digraph Products
Mathematics, 2020 A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partition of V ( D ) .
Dragana Božović, Iztok Peterin
doaj +1 more source
Study of Cayley Digraphs over Polygroups
MathematicsIn this paper we introduce Cayley digraphs associated to finitely generated polygroups, where the vertices correspond to finite products of the generators of polygroups and the edges to multiplication by vertices and generators.
Ali Sanjabi +4 more
doaj +1 more source
A Note on the Concept of Time in Extensive Games
Mathematics, 2022 Using the concept of informational digraphs, we propose a “no redundant information sets” property that can characterize the exact class of extensive games which can be time structured. Our result can be applied to define time-dependent solution concepts
Shravan Luckraz, Bruno Antonio Pansera
doaj +1 more source
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanmei Hong, Hong-Jian Lai, Qinghai Liu
openaire +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
Computers & Mathematics with Applications, 1997 The authors recall known results concerning distance in a graph and standard distance in a digraph. They define two new distances in strong digraphs: \(d_{\max} (u,v)= \max (d(u,v),\;d(v,u))\) and \(d_{\text{sum}} (u,v)= d(u,v) +d(v,u)\). Several results and problems concerning these distances and parameters such as center, median, and periphery are ...
Chartrand, G., Tian, S.
openaire +1 more source
Discrete Applied Mathematics30 pages, 17 figures, 5 tables, 61 ...
Nino Basic +3 more
openaire +4 more sources