Results 11 to 20 of about 712,475 (276)
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
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.
Esther M. Arkin, Refael Hassin
openaire +3 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
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
Theory and Applications of Graphs, 2023 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
Discrete Mathematics & Theoretical Computer Science, 2023 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]
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
The mixed page number of graphs
Theoretical Computer Science, 2022 A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.
Jawaherul Md. Alam +4 more
openaire +2 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