Results 1 to 10 of about 184,542 (302)
A note on orientations of mixed graphs [PDF]
Discrete Applied Mathematics, 2002 The authors study an orientation problem on mixed graphs. The goal is to obtain a directed graph satisfying a certain connectivity requirement. First the authors continue the study of the pair connectivity problem and show that it is NP-complete for mixed graphs. Then they prove several results for two pairs of nodes of mixed graphs.
Esther M. Arkin, Refael Hassin
openalex +2 more sources
Bernoulli, 2013 Published in at http://dx.doi.org/10.3150/12-BEJ454 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm)
Kayvan Sadeghi
openalex +4 more sources
Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs [PDF]
Journal of Inequalities and Applications, 2017 Let M be a mixed graph and H ( M ) $H(M)$ be its Hermitian-adjacency matrix. If we add a Randić weight to every edge and arc in M, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix?
Yong Lu, Ligong Wang, Qiannan Zhou
doaj +2 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 +3 more sources
Stochastic and mixed flower graphs [PDF]
Physical Review E, 2020 11 pages, 6 ...
C. Tyler Diggans +2 more
openalex +6 more sources
Bivariate Chromatic Polynomials of Mixed Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this notion to
Matthias Beck, Sampada Kolhatkar
doaj +4 more sources
𝕮-inverse of graphs and mixed graphs
Open MathematicsThis article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph GG with adjacency matrix A(G)A\left(G), the inverse graph G−1{G}^{-1} is defined such that its adjacency matrix is similar
Alomari Omar +2 more
doaj +2 more sources
Colored Homomorphisms of Colored Mixed Graphs
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jaroslav Nešetřil, André Raspaud
openalex +4 more sources
On spectral integral variations of mixed graphs
Linear Algebra and its Applications, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi-Zheng Fan
openalex +4 more sources
Rational mixed Tate motivic graphs [PDF]
Annals of K-Theory, 2017 53 ...
Susama Agarwala, Owen Patashnick
openalex +7 more sources