Results 31 to 40 of about 197 (101)
Homomorphically Full Oriented Graphs [PDF]
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways.
Thomas Bellitto +2 more
doaj +1 more source
On incidence algebras and directed graphs
The incidence algebra I(X, ℝ) of a locally finite poset (X, ≤) has been defined and studied by Spiegel and O′Donnell (1997). A poset (V, ≤) has a directed graph (Gv, ≤) representing it. Conversely, any directed graph G without any cycle, multiple edges, and loops is represented by a partially ordered set VG.
Ancykutty Joseph
wiley +1 more source
Products Of Digraphs And Their Competition Graphs
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v} ⊆ V is an edge of CGl(D) if and only if there is a vertex w ∈ V such that (u, w), (v, w) ∈ A.
Sonntag Martin, Teichert Hanns-Martin
doaj +1 more source
The second out-neighborhood for local tournaments
Sullivan stated the conjectures: (1) every oriented graph has a vertex x such that d ++(x) ≥ d −(x) and (2) every oriented graph has a vertex x such that d ++(x) + d +(x) ≥ 2d −(x)
Li Ruijuan, Liang Juanjuan
doaj +1 more source
How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm [PDF]
In 2020 Bang-Jensen et. al. generalized the Haj\'os join of two graphs to the class of digraphs and generalized several results for vertex colorings in digraphs.
Juan Carlos García-Altamirano +2 more
doaj +1 more source
Families of (1, 2)‐symplectic metrics on full flag manifolds
We obtain new families of (1, 2)‐symplectic invariant metrics on the full complex flag manifolds F(n). For n ≥ 5, we characterize n − 3 different n‐dimensional families of (1, 2)‐symplectic invariant metrics on F(n). Each of these families corresponds to a different class of nonintegrable invariant almost complex structures on F(n).
Marlio Paredes
wiley +1 more source
About (k, l)-Kernels, Semikernels and Grundy Functions in Partial Line Digraphs
Let D be a digraph of minimum in-degree at least 1. We prove that for any two natural numbers k, l such that 1 ≤ l ≤ k, the number of (k, l)-kernels of D is less than or equal to the number of (k, l)-kernels of any partial line digraph ℒD. Moreover, if l
Balbuena C. +2 more
doaj +1 more source
Incidence matrices and line graphs of mixed graphs
In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad +2 more
doaj +1 more source
Algorithmic aspects of bipartite graphs
We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill‐in of a given ordered graph.
Mihály Bakonyi, Erik M. Varness
wiley +1 more source
Total Roman domination on the digraphs
Let D=(V,A)D=\left(V,A) be a simple digraph with vertex set VV, arc set AA, and no isolated vertex. A total Roman dominating function (TRDF) of DD is a function h:V→{0,1,2}h:V\to \left\{0,1,2\right\}, which satisfies that each vertex x∈Vx\in V with h(x ...
Zhang Xinhong, Song Xin, Li Ruijuan
doaj +1 more source

