Results 21 to 30 of about 712,475 (276)
Integral mixed circulant graphs
A mixed graph is said to be \textit{integral} if all the eigenvalues of its Hermitian adjacency matrix are integer. The \textit{mixed circulant graph} $Circ(\mathbb{Z}_n,\mathcal{C})$ is a mixed graph on the vertex set $\mathbb{Z}_n$ and edge set $\{ (a,b): b-a\in \mathcal{C} \}$, where $0\not\in \mathcal{C}$.
Monu Kadyan, Bikash Bhattacharjya
openaire +3 more sources
Incidence matrices and line graphs of mixed graphs
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
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
HS-integral and Eisenstein integral mixed circulant graphs
A mixed graph is called \emph{second kind hermitian integral} (\emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers.
Monu Kadyan, Bikash Bhattacharjya
doaj +1 more source
The Spectral Distribution of Random Mixed Graphs
In this work, we propose a random mixed graph model Gn(p(n),q(n)) that incorporates both the classical Erdős-Rényi’s random graph model and the random oriented graph model.
Yue Guan +7 more
doaj +1 more source
Colourings of $(m, n)$-coloured mixed graphs [PDF]
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of ...
Gary MacGillivray +2 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minh Hoang Nguyen +2 more
openaire +1 more source
Graph Models of Automobile Gears - Kinematics
In the present paper, kinematical analysis of an automotive gear is described. Versatile graph based methods have been utilized for this purpose. An application of mixed, contour and bond graphs gives the same results. It allows the detection of possible
J. Drewniak, J. Kopeć, S. Zawiślak
doaj +1 more source
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source
A Characterization of Mixed Unit Interval Graphs [PDF]
We give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half-open unit intervals of the real line. This is a proper superclass of the well known unit interval graphs.
CG Lekkerkerker +9 more
core +1 more source

