Results 11 to 20 of about 208,068 (260)
Moore mixed graphs from Cayley graphs
Electronic Journal of Graph Theory and Applications, 2023 A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs. When the order of G is close to M(
Cristina Dalfo, Miquel Àngel Fiol
doaj +3 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
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
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
γ-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
A note on orientations of mixed graphs
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.
Refael Hassin, Esther M Arkin
exaly +2 more sources
Debunking misleading graphs effectively: How vocationally educated young adults perceive graphs. [PDF]
PLoS ONEMisleading graphs can give readers a distorted view of the underlying data. We want to know how to most effectively correct misleading graphs and if it matters whether a correction uses the full-design of the original or a clean design with all ...
Winnifred Wijnker +3 more
doaj +2 more sources
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications [PDF]
Scientific ReportsResolvability parameters of graphs are widely applicable in fields like computer science, chemistry, and geography. Many of these parameters, such as the metric dimension, are computationally hard to determine. This paper focuses on Möbius-type geometric
Sakander Hayat +6 more
doaj +2 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 +1 more source