Results 71 to 80 of about 197 (101)

γ-Inverse graph of some mixed graphs

open access: yesSpecial Matrices
Let GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa   +2 more
doaj   +1 more source

Causal structure learning in directed, possibly cyclic, graphical models

open access: yesJournal of Causal Inference
We consider the problem of learning a directed graph G⋆{G}^{\star } from observational data. We assume that the distribution that gives rise to the samples is Markov and faithful to the graph G⋆{G}^{\star } and that there are no unobserved variables.
Semnani Pardis, Robeva Elina
doaj   +1 more source

γ-Cycles In Arc-Colored Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
We call a digraph D an m-colored digraph if the arcs of D are colored with m colors. A directed path (or a directed cycle) is called monochromatic if all of its arcs are colored alike.
Galeana-Sánchez Hortensia   +2 more
doaj   +1 more source

A branch-and-cut algorithm for the target visitation problem

open access: yesEURO Journal on Computational Optimization, 2019
In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj   +1 more source

The hybrid number of a ploidy profile. [PDF]

open access: yesJ Math Biol, 2022
Huber KT, Maher LJ.
europepmc   +1 more source

A new bound for the spectral radius of Brualdi-Li matrices

open access: yesSpecial Matrices, 2015
Let B2m denote the Brualdi-Li matrix of order 2m, and let ρ2m = ρ(B2m ) denote the spectral radius of the Brualdi-Li Matrix ...
Chen Xiaogen
doaj   +1 more source

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs

open access: yesForum of Mathematics, Sigma
A conjecture of Jackson from 1981 states that every d-regular oriented graph on n vertices with $n\leq 4d+1$ is Hamiltonian. We prove this conjecture for sufficiently large n.
Allan Lo   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy