Results 11 to 20 of about 184,542 (302)
A new general family of mixed graphs [PDF]
A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the cycle prefix digraphs. The obtained graphs are vertex transitive and, for some values of the parameters, they constitute the best infinite families with asymptotically optimal (or quasi-optimal) diameter for their number of ...
C. Dalfó
openalex +6 more sources
γ-Inverse graph of some mixed graphs
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 +2 more sources
Graph-structured populations elucidate the role of deleterious mutations in long-term evolution [PDF]
Birth-death models are used to understand the interplay of genetic drift and natural selection. While well-mixed populations remain unaffected by the order of birth and death and where selection acts, evolutionary outcomes in spatially structured ...
Nikhil Sharma +3 more
doaj +2 more sources
Abstract Let n , s be integers, n ≥ 2 ( s + 1 ) ≥ 4 . Let F , G ⊂ [ n ] 2 be two graphs. We determine the exact maximum of | F | + | G | subject to the condition that there is no matching of size s + 1 contained in F ∪ G and having non-empty intersection with ...
Péter Frankl
openalex +3 more sources
Research on the design of smartwatch health information visualization presentation under different motion scenarios [PDF]
Investigating how to adapt smartwatches to meet the distinct needs of users across various motion scenarios, while optimizing visual presentation design to enhance user experience, is an area that deserves thorough exploration.
Wenkui Jin, Wanlin Deng
doaj +2 more sources
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +1 more source
Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
Geoffrey Exoo
doaj +1 more source
On bipartite‐mixed graphs [PDF]
AbstractMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this article, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore‐like bound is attained in the case of diameter , and that bipartite‐mixed graphs of diameter do not exist.
Dalfó Simó, Cristina +2 more
openaire +5 more sources
Enumeration of Mixed Graphs [PDF]
and three oriented lines. An ordinary graph may be regarded as a mixed graph with no oriented lines, and an oriented graph as a mixed graph with no ordinary lines. Further, any digraph may be considered as a mixed graph by changing each symmetric pair of lines to an ordinary line.
Ed Palmer, Frank Harary
openaire +1 more source
Graphs with mixed metric dimension three and related algorithms
Let $ G = (V, E) $ be a simple connected graph. A vertex $ x\in V(G) $ resolves the elements $ u, v\in E(G)\cup V(G) $ if $ d_G(x, u)\neq d_G(x, v) $.
Dalal Awadh Alrowaili +3 more
doaj +1 more source

