Results 71 to 80 of about 8,914 (221)
Asymptotic comparison of two constructions for large digraphs of given degree and diameter [PDF]
, 2009 summary:We compare the asymptotic growth of the order of the digraphs arising from a construction of Comellas and Fiol when applied to Faber-Moore digraphs versus plainly the Faber-Moore digraphs for the corresponding degree and ...
Staneková, Ľubica +1 more
core +1 more source
Dual digraphs of finite meet-distributive and modular lattices
CuboWe describe the digraphs that are dual representations of finite lattices satisfying conditions related to meet-distributivity and modularity. This is done using the dual digraph representation of finite lattices by Craig, Gouveia and Haviar (2015 ...
Andrew Craig +2 more
doaj +1 more source
A Theorem on Even Pancyclic Bipartite Digraphs
Mathematical Problems of Computer Science, 2021 We prove a Meyniel-type condition and a Bang-Jensen, Gutin and Li-type condition for a strongly connected balanced bipartite digraph to be even pancyclic. Let D be a balanced bipartite digraph of order 2a ≥ 6.
Samvel Kh. Darbinyan
doaj +1 more source
Two‐Block Paths in Oriented Graphs of Large Semidegree
Journal of Graph Theory, EarlyView.ABSTRACT We study the existence of oriented paths with two blocks in oriented graphs under semidegree conditions. A block of an oriented path is a maximal directed subpath. Given positive integers k $k$ and ℓ $\ell $ with k / 2 ≤ ℓ < k $k/2\le \ell \lt k$, we establish a semidegree function that guarantees the containment of every oriented path with ...
Irena Penev +4 more
wiley +1 more source
Out‐colourings of digraphs [PDF]
, 2020 We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring. The problem of deciding whether a given digraph has an out-colouring with only two colours (called a 2-out-colouring) is ...
Stéphane Bessy +6 more
core +1 more source
On locally irregular decompositions and the 1-2 Conjecture in digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits a 2-total-weighting such that the sums of weights "incident" to the vertices yield a proper vertex-colouring.
Olivier Baudon +3 more
doaj +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Journal of Algebra Combinatorics Discrete Structures and Applications, 2022 A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of the set are labelled 0 and one half labelled 1. Let $g$ be a labelling of the edge set of a graph that is induced by a labelling $f$ of the vertex set. If both $g$ and $f$ are friendly then $g$ is said to be a {\em cordial} labelling of the graph.
Beasley, LeRoy B. +3 more
openaire +2 more sources
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boland, James +2 more
openaire +3 more sources