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 +4 more sources
New concepts of inverse fuzzy mixed graphs and its application. [PDF]
Granul Comput, 2022 Fuzzy mixed graph (FMG) can be used to model some graphical intercommunication network systems if there are many directed and undirected relations between some vertices.
Poulik S, Ghorai G.
europepmc +2 more sources
Incidence matrices and line graphs of mixed graphs [PDF]
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 +2 more sources
Structural factor equation models for causal network construction via directed acyclic mixed graphs. [PDF]
Biometrics, 2021 Directed acyclic mixed graphs (DAMGs) provide a useful representation of network topology with both directed and undirected edges subject to the restriction of no directed cycles in the graph. This graphical framework may arise in many biomedical studies,
Zhou Y, Song PX, Wen X.
europepmc +2 more sources
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.
Jessica Enright, Lorna Stewart
doaj +6 more sources
Twin-width and Transductions of Proper k-Mixed-Thin Graphs [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2022 The new graph parameter twin-width, introduced by Bonnet, Kim, Thomass e and Watrigant in 2020, allows for an FPT algorithm for testing all FO properties of graphs.
Jakub Balabán +2 more
openalex +2 more sources
From one-way streets to percolation on random mixed graphs [PDF]
Physical Review E, 2021 In most studies, street networks are considered as undirected graphs while one-way streets and their effect on shortest paths are usually ignored. Here, we first study the empirical effect of one-way streets in about 140 cities in the world.
Vincent Verbavatz, Marc Barthélemy
openalex +3 more sources
Discrete Applied Mathematics, 2016 A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and literated line digraphs.
Dalfó Simó, Cristina +2 more
core +5 more sources
Using Joint Display as an Analytic Process: An Illustration Using Bar Graphs Joint Displays From a Mixed Methods Study of How Beliefs Shape Secondary School Teachers’ Use of Technology [PDF]
International Journal of Qualitative Methods, 2021 Qualitative researchers engaged in mixed methods studies need novel approaches for integrating qualitative and quantitative findings during analysis. Joint display visuals have become an integral part of the presentation of the findings of mixed methods ...
Tashane Haynes-Brown, Michael D. Fetters
openalex +2 more sources
On mixed graphs whose Hermitian spectral radii are at most 2 [PDF]
Graphs Comb., 2019 A mixed graph is a graph with undirected and directed edges. Guo and Mohar in 2017 determined all mixed graphs whose Hermitian spectral radii are less than 2.
Bo-Jun Yuan +3 more
openalex +2 more sources