Results 1 to 10 of about 706,727 (273)
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.
Enright, Jessica, Stewart, Lorna
core +5 more sources
Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs. [PDF]
J Inequal Appl, 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?
Lu Y, Wang L, Zhou Q.
europepmc +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 +5 more sources
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications. [PDF]
Sci RepResolvability 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
Hayat S +6 more
europepmc +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 ...
Wijnker W +3 more
europepmc +2 more sources
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
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
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
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