Results 121 to 130 of about 6,654 (223)

Distant digraph domination [PDF]

A k-kernel in a digraph G is a stable set X of vertices such that every vertex of G can be joined from X by a directed path of length at most k. We prove three results about k-kernels.
Nguyen, Tung, Scott, Alex, Seymour, Paul
core   +3 more sources

On the girth of digraphs

Discrete Mathematics, 2000
Let \(G\) denote a strongly-connected digraph with \(n\) nodes, girth \(g\), and diameter \(D\). The author shows that if \(G\) has \(t\) nodes of out-degree one, then \(D\leq n-g+ t\). He also shows that if \(r\) denotes the minimum out-degree of \(G\), then \(g\leq \max\{\lceil n/r\rceil, 2r- 2\}\). This last result implies that when \(n\geq 2r^2- 3r+
openaire   +2 more sources

Digraph Placement Games [PDF]

This paper considers a natural ruleset for playing a partisan combinatorial game on a directed graph, which we call Digraph Placement. Given a digraph $G$ with a not necessarily proper $2$-coloring of $V(G)$, the Digraph Placement game played on $G$ by ...
McKay, Neil A, Clow, Alexander
core   +1 more source

Characterizations of Solutions in Digraph Competitions [PDF]

, 2002
The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on ...
Borm, P.E.M., Voorneveld, M., Quant, M., Quant, M.; id_orcid, Reijnierse, J.H., Borm, P.E.M.; id_orcid   +5 more
core  

DIGRAPH EKSENTRIS DARI POHON [PDF]

, 2002
Dari graph khususnya graph yang berbentuk pohon, dapat dibentuk digraph eksentris, yaitu digraph yang himpunan titiknya sama dengan himpunan titik pada pohon T dan terdapat busur dari u ke v pada ED (T), jika v titik eksentris dari u pada pohon ...
NENI ISNEINI, 089711667
core  

Rational construction method for linearly extended structures based on alterative options [PDF]

Инженерно-строительный журнал, 2012
In the development of construction technology of linearly extended structures at the stage work production plan the possibility to reduce the construction time and improving organizational and technological reliability, represented by the presence of ...
G.I. Abdullaev
doaj  

Path Hamilton pada Digraph Cayley [PDF]

, 2014
This paper is a descriptive-qualitative research methods literature (library research) research that examines the literature, especially on digraph Cayley for the purpose of collecting data and information with the help of a variety of materials such ...
Br Sembiring, Metrilitna
core  

Signed Total Roman Domination in Digraphs

Discussiones Mathematicae Graph Theory, 2017
Let D be a finite and simple digraph with vertex set V (D). A signed total Roman dominating function (STRDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑x∈N−(v)f(x) ≥ 1 for each v ∈ V (D), where N−(v) consists ...
Volkmann Lutz
doaj   +1 more source

Convergence of iterative algorithm for G-nonexpansive mapping with digraph: application on G-variational inequality problem and signal recovery

Applied Mathematics in Science and Engineering
The Halpern iteration method is among the most extensively studied approaches in the literature concerning the approximation of fixed points of G-nonexpansive mappings.
Esra Yolaçan
doaj   +1 more source

Słupecki digraphs

Algebra universalis
Abstract Call a finite relational structure k-Słupecki if its only surjective k -ary polymorphisms are essentially unary, and Słupecki if it is k -Słupecki
Kunos, Ádám, Larose, Benoît, Pullas, David Emmanuel Pazmiño   +2 more
openaire   +2 more sources