Results 91 to 100 of about 63,846 (213)
Perfect State Transfer in Laplacian Quantum Walk [PDF]
, 2014 For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals.
Alvir, R. +6 more
core
Seidel Laplacian and Seidel Signless Laplacian Energies of Commuting Graph for Dihedral Groups
Malaysian Journal of Fundamental and Applied SciencesIn this paper, we discuss the energy of the commuting graph. The vertex set of the graph is dihedral groups and the edges between two distinct vertices represent the commutativity of the group elements.
M. Romdhini +2 more
semanticscholar +1 more source
On maximum signless Laplacian Estrada index of graphs with given parameters II
Electronic Journal of Graph Theory and Applications, 2018 The signless Laplacian Estrada index of a graph G is defined as SLEE(G) = ∑ni = 1eqi where q1, q2, …, qn are the eigenvalues of the signless Laplacian matrix of G.
Ramin Nasiri +3 more
doaj +1 more source
Graphs with maximum Laplacian and signless Laplacian Estrada index
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutman, Ivan +3 more
openaire +1 more source
Maximum principal ratio of the signless Laplacian of graphs [PDF]
, 2022 Lele Liu, Shengming Hu, Changxiang He
openalex +1 more source
Signless Laplacian eigenvalue problems of Nordhaus–Gaddum type [PDF]
Linear Algebra and its Applications, 2019 17 pages, 2 ...
Xueyi Huang, Huiqiu Lin
openaire +3 more sources
New constructions of nonregular cospectral graphs
Special MatricesWe consider two types of joins of graphs G1{G}_{1} and G2{G}_{2}, G1⊻G2{G}_{1}\hspace{0.33em}⊻\hspace{0.33em}{G}_{2} – the neighbors splitting join and G1∨=G2{G}_{1}\mathop{\vee }\limits_{=}{G}_{2} – the nonneighbors splitting join, and compute ...
Hamud Suleiman, Berman Abraham
doaj +1 more source
Some upper bounds for the signless Laplacian spectral radius of digraphs [PDF]
Transactions on Combinatorics, 2019 Let $G=(V(G),E(G))$ be a digraph without loops and multiarcs, where $V(G)=\{v_1,v_2,$ $\ldots,v_n\}$ and $E(G)$ are the vertex set and the arc set of $G$, respectively. Let $d_i^{+}$ be the outdegree of the vertex $v_i$.
Weige Xi, Ligong Wang
doaj +1 more source
Signless Laplacians and line graphs
Bulletin: Classe des sciences mathematiques et natturalles, 2005 The spectrum of a graph is the spectrum of its adjacency matrix. The author studies the phenomenon of cospectrality in graphs by comparing characterizing properties of spectra of graphs and spectra of their line graphs. In this comparison spectra of signless Laplacians of graphs are used.
openaire +2 more sources
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xi, Weige, Wang, Ligong
openaire +1 more source