Results 11 to 20 of about 259,405 (306)
Inverse neutrosophic mixed graphs [PDF]
Journal of Fuzzy Extension and ApplicationsThis article successfully attempts to introduce the notion of Inverse Neutrosophic Mixed Graphs (INMG) together with its applications. This novel approach highlights the network modeling of real physical situations with indeterminacy.
Thempaavai Jayaprakash +1 more
doaj +2 more sources
Turán Problems for Mixed Graphs [PDF]
Journal of Combinatorial Theory, Series B, 2022 We investigate natural Turán problems for mixed graphs, generalizations of graphs where edges can be either directed or undirected. We study a natural \textit{Turán density coefficient} that measures how large a fraction of directed edges an $F$-free mixed graph can have; we establish an analogue of the Erdős-Stone-Simonovits theorem and give a ...
Nitya Mani, Edward Yu
openalex +4 more sources
γ-Inverse graph of some mixed graphs
Special MatricesLet 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
𝕮-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
Integral mixed circulant graphs
Discrete Mathematics, 2023 A mixed graph is said to be \textit{integral} if all the eigenvalues of its Hermitian adjacency matrix are integer. The \textit{mixed circulant graph} $Circ(\mathbb{Z}_n,\mathcal{C})$ is a mixed graph on the vertex set $\mathbb{Z}_n$ and edge set $\{ (a,b): b-a\in \mathcal{C} \}$, where $0\not\in \mathcal{C}$.
Monu Kadyan, Bikash Bhattacharjya
openaire +3 more sources
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
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
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
Stochastic and mixed flower graphs [PDF]
Physical Review E, 2020 11 pages, 6 ...
C. Tyler Diggans +2 more
openaire +3 more sources
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