Results 101 to 110 of about 6,654 (223)
Tree-average distances on certain phylogenetic networks have their weights uniquely determined
Algorithms for Molecular Biology, 2012 A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head.
Willson Stephen J
doaj +1 more source
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
Journal of Graph Theory, Volume 112, Issue 4, Page 421-432, August 2026.ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) denote the minimum size of a feedback arc set in an oriented multigraph D. In several papers, upper bounds for fas ( D ) were obtained for oriented multigraphs D with maximum degree upper‐bounded by a constant.
Gregory Gutin +3 more
wiley +1 more source
SYARAT PERLU DAN CUKUP ISOMORFISMA DIGRAPH [PDF]
, 2004 Berdasarkan definisi isomortisma digraph, dapat ditentukan apaknh dua digraph isomorfis atau tidak. Tetapi, untuk menentukan isomorfisma digraph yang banyaknya titik dan garis berarahnya cukup besar tidaklah mudah dan memakan banyak waktu.
KHOLIFAH, 080012237
core
Tr-Span of Directed Wheel Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +1 more source
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Unordered Love in infinite directed graphs
International Journal of Mathematics and Mathematical Sciences, 1992 A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source
KONSTRUKSI DIGRAPH EKSENTRIS DENGAN MATRIKS ADJACENCY [PDF]
, 2004 The objective of this thesis is to find the connection between adjacency matrix of digraph and adjacency matrix of its eccentric dib'T3ph, and algorithm for constructing eccentric digraph from digraph based on the connection.
AGUS YASIN KURNIAWAN, 089911925
core
Discrete Mathematics, 1997 ``This paper focuses on a family of vertex symmetric digraphs \dots which were introduced by \textit{M. L. Fiol} [The relation between digraphs and groups through Cayley digraphs, Universitat Autònoma de Barcelona, 1984 (in Catalan)].'' For integers \(k\) and \(n\), \(1\leq k\leq n-1\), a digraph \(P(n,k)\) has as vertices the \(k\)-permutations of ...
Josep M. Brunat +2 more
openaire +1 more source
DiGraph/Occam: Users Guide [PDF]
, 2007 This document describes how to use DiGraph/Occam. It assumes that the user has read the documentation for the basic editor: DiGraph: Users Guide. Refer to this document to learn how to use the basic graph editor.
Ivan Porres, Iv#n Porres Paltor
core
Line digraph iterations and the (d,k) digraph problem [PDF]
This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, to maximize the number of vertices ...
Fiol Mora, Miquel Àngel +2 more
core