Results 1 to 10 of about 2,542,324 (299)
On bipartite (1,1,k)-mixed graphs [PDF]
The Art of Discrete and Applied MathematicsMixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs, in terms of the number of vertices, are presented for small diameters.
Dalfó Simó, Cristina +4 more
openaire +7 more sources
Amplification on Undirected Population Structures: Comets Beat Stars
Scientific Reports, 2017 The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population.
Andreas Pavlogiannis +3 more
doaj +1 more source
IEEE Access, 2015 Unfortunately, we had mixed up some results when we plotted the graphs in Figure 7 of the above paper. This affected only the two blue curves in each of the three graphs, for $2\times 2$ MIMO in Random-LOS with LP and CP incidences, and had no ...
Per-Simon Kildal +4 more
doaj +1 more source
Graph Mixing Additive Networks
CoRRarXiv admin note: substantial text overlap with arXiv:2505 ...
Maya Bechler-Speicher +7 more
openaire +2 more sources
Characterization of Fractional Mixed Domination Number of Paths and Cycles
Journal of MathematicsLet G′ be a simple, connected, and undirected (UD) graph with the vertex set M(G′) and an edge set N(G′). In this article, we define a function f:M∪N⟶0,1 as a fractional mixed dominating function (FMXDF) if it satisfies fRmx=∑yϵRmxfy≥1 for all x∈MG′∪NG′,
P. Shanthi +5 more
doaj +1 more source
On the mixed adjacency matrix of a mixed graph
Linear Algebra and its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adiga, Chandrashekar +2 more
openaire +3 more sources
A Characterization of Mixed Unit Interval Graphs [PDF]
Journal of Graph Theory, 2014 AbstractWe give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half‐open unit intervals of the real line. This is a proper superclass of the well‐known unit interval graphs. Our result solves a problem posed by Dourado, Le, Protti, Rautenbach, and Szwarcfiter (Mixed unit interval graphs, Discrete
openaire +2 more sources
Universal Mixing of Quantum Walk on Graphs
Quantum Information and Computation, 2007 We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph $G$ is {\em universal mixing} if the instantaneous or average probability distribution of the quantum walk on $G$ ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph
William Carlson +5 more
openaire +3 more sources
Path-driven orientation of mixed graphs
Discrete Applied Mathematics, 2015 We consider in this paper two graph orientation problems. The input of both problems is (i) a mixed graph G whose vertex set is V and edge set (resp. arc set) is E (resp. A) and (ii) a set P V V of source-target pairs. The first problem, called S-GO, is a decision problem introduced by Hassin and Megiddo (Linear Algebra and its Applications 114 (1989):
Guillaume Fertin +2 more
openaire +4 more sources
Propagation Computation for Mixed Bayesian Networks Using Minimal Strong Triangulation
MathematicsIn recent years, mixed Bayesian networks have received increasing attention across various fields for probabilistic reasoning. Though many studies have been devoted to propagation computation on strong junction trees for mixed Bayesian networks, few have
Yao Liu +3 more
doaj +1 more source