Results 61 to 70 of about 282,172 (197)
Graph Mixed Random Network Based on PageRank
In recent years, graph neural network algorithm (GNN) for graph semi-supervised classification has made great progress. However, in the task of node classification, the neighborhood size is often difficult to expand.
Qianli Ma +3 more
core +1 more source
In the era of gravitational wave (GW) detection from astrophysical sources by LIGO/VIRGO, it is of great importance to take the quantum gravity effect of graviton-photon (GRAPH) mixing in the cosmic magnetic field to the next level. In this work, we study such an effect and derive for the first time perturbative solutions of the linearized equations of
Ejlli, Damian, Thandlam, Venugopal R.
openaire +2 more sources
Cayley graphs are well known objects with interesting properties, also in the context of Moore graphs and digraphs. In $1978$ Bos\'ak extended Moore's property to the mixed setting (with arcs allowed along with edges), in the so called mixed Moore graphs: those having a unique trail--path?
Nacho López +2 more
openaire +2 more sources
Approximation algorithms for orienting mixed graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Elberfeld +4 more
openaire +2 more sources
Principal minors of Hermitian (quasi-)Laplacian matrix of second kind for mixed graphs [PDF]
Qi Xiong, Gui-Xian Tian, Shu-Yu Cui
doaj +1 more source
On the mixed domination problem in graphs
A mixed dominating set of a simple graph G=(V,E) is a subset [email protected][email protected]?E such that every vertex or edge not in D is adjacent or incident to at least one vertex or edge in D. The mixed domination problem is to determine a minimum mixed dominating set of G.
James K. Lan, Gerard Jennhwa Chang
openaire +1 more source
Mixing 3-Colourings in Bipartite Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luis Cereceda +2 more
openaire +3 more sources
Representations of Quivers and Mixed Graphs [PDF]
This is a survey article for "Handbook of Linear Algebra", 2nd ed., Chapman & Hall/CRC, 2014. An informal introduction to representations of quivers and finite dimensional algebras from a linear algebraist's point of view is given. The notion of quiver representations is extended to representations of mixed graphs, which permits one to study ...
Horn, Roger A., Sergeichuk, Vladimir V.
openaire +2 more sources
Coloring Mixed and Directional Interval Graphs
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that assigns to each vertex in $G$ a positive integer such that, for each edge $uv$ in $G$, $c(u) \ne c(v)$ and, for each arc $uv$ in $G$, $c(u) < c(v)$. For a mixed graph $G$, the chromatic number $χ(G)
Grzegorz Gutowski +5 more
openaire +5 more sources
Decompositions of the Complete Mixed Graph by Mixed Stars
In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph?
Culver, Chance
core

