Results 51 to 60 of about 937,585 (316)
The Laplacian eigenvalues of mixed graphs
The first part of the paper gives an upper bound for the second smallest Laplacian eigenvalue of the mixed graphs, thereby generalizing the results of \textit{M. Fiedler} [Czech. Math. J. 23, 298-305 (1973; Zbl 0265.05119)]. The second part presents two sharp upper bounds for the largest Laplacian eigenvalues of the mixed graphs in terms of the largest,
Rong Luo, Xiao-Dong Zhang
openaire +3 more sources
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 +2 more sources
Inverse neutrosophic mixed graphs [PDF]
This article successfully attempts to introduce the notion of Inverse Neutrosophic Mixed Graphs (INMG) together with its applications. This novel approach highlights the network modeling of real physical situations with indeterminacy.
Thempaavai Jayaprakash +1 more
doaj +1 more source
A Comparative Study of Three Resolving Parameters of Graphs
Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures,
Hafiz Muhammad Ikhlaq +2 more
doaj +1 more source
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 ...
Roger A. Horn, Vladimir V. Sergeichuk
openaire +3 more sources
The Laplacian spectrum of a mixed graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-Dong Zhang, Jiong-Sheng Li
openaire +3 more sources
Uniform Mixing on Cayley Graphs [PDF]
We provide new examples of Cayley graphs on which the quantum walks reach uniform mixing. Our first result is a complete characterization of all $2(d+2)$-regular Cayley graphs over $\mathbb{Z}_3^d$ that admit uniform mixing at time $2\pi/9$. Our second result shows that for every integer $k\ge 3$, we can construct Cayley graphs over $\mathbb{Z}_q^d ...
Hanmeng Zhan, Chris Godsil
openaire +2 more sources
Mixed Moore Cayley Graphs [PDF]
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected edges and directed arcs in the graph.
openaire +4 more sources
Moore mixed graphs from Cayley graphs
This research has been partially supported by AGAUR from the Catalan Government under project 2021SGR00434 and MICINN from the Spanish Government under project PID2020-115442RBI00.
Dalfó Simó, Cristina +1 more
openaire +3 more sources
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

