Results 11 to 20 of about 191,710 (309)
On bipartite‐mixed graphs [PDF]
Journal of Graph Theory, 2018 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
Total mixed domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2022 For a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the minimum ...
Adel P. Kazemi +2 more
doaj +1 more source
Graphs with mixed metric dimension three and related algorithms
AIMS Mathematics, 2023 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
Incidence matrices and line graphs of mixed graphs
Special Matrices, 2023 In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad +2 more
doaj +1 more source
Enumeration of Mixed Graphs [PDF]
Proceedings of the American Mathematical Society, 1966 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.
Harary, Frank, Palmer, Edgar M.
openaire +1 more source
The Vertex-Edge Resolvability of Some Wheel-Related Graphs
Journal of Mathematics, 2021 A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H ...
Bao-Hua Xing +4 more
doaj +1 more source
Stochastic and mixed flower graphs [PDF]
Physical Review E, 2020 11 pages, 6 ...
C. Tyler Diggans +2 more
openaire +3 more sources
Equivalence of the filament and overlap graphs of subtrees of limited trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs.
Jessica Enright, Lorna Stewart
doaj +1 more source
HS-integral and Eisenstein integral mixed circulant graphs
Theory and Applications of Graphs, 2023 A mixed graph is called \emph{second kind hermitian integral} (\emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers.
Monu Kadyan, Bikash Bhattacharjya
doaj +1 more source
The Spectral Distribution of Random Mixed Graphs
Axioms, 2022 In this work, we propose a random mixed graph model Gn(p(n),q(n)) that incorporates both the classical Erdős-Rényi’s random graph model and the random oriented graph model.
Yue Guan +7 more
doaj +1 more source