Results 71 to 80 of about 1,304 (147)
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
Mathematics, 2023 Using the notions of clique partitions and edge clique covers of graphs, we consider the corresponding incidence structures. This connection furnishes lower bounds on the negative eigenvalues and their multiplicities associated with the adjacency matrix,
Shaun Fallat, Seyed Ahmad Mojallal
doaj +1 more source
Distance Spectra of Some Double Join Operations of Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha +4 more
wiley +1 more source
Some Properties of the Strong Primitivity of Nonnegative Tensors
Journal of Applied Mathematics, Volume 2018, Issue 1, 2018., 2018 We show that an order m dimension 2 tensor is primitive if and only if its majorization matrix is primitive, and then we obtain the characterization of order m dimension 2 strongly primitive tensors and the bound of the strongly primitive degree. Furthermore, we study the properties of strongly primitive tensors with n ≥ 3 and propose some problems for
Lihua You +3 more
wiley +1 more source
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
, 2015 Let $\mathcal{A(}G\mathcal{)},\mathcal{L(}G\mathcal{)}$ and $\mathcal{Q(}% G\mathcal{)}$ be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph $G$, respectively.
Qi, Liqun, Shao, Jiayu, Yuan, Xiying
core +1 more source
Generalized Characteristic Polynomials of Join Graphs and Their Applications
Discrete Dynamics in Nature and Society, Volume 2017, Issue 1, 2017., 2017 The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices of G in electrical networks. LEL(G) is the Laplacian‐Energy‐Like Invariant of G in chemistry. In this paper, we define two classes of join graphs: the subdivision‐vertex‐vertex join G1⊚G2 and the subdivision‐edge‐edge join G1⊝G2.
Pengli Lu +3 more
wiley +1 more source
The Extremal Structures of r-Uniform Unicyclic Hypergraphs on the Signless Laplacian Estrada Index
Mathematics, 2022 SLEE has various applications in a large variety of problems. The signless Laplacian Estrada index of a hypergraph H is defined as SLEE(H)=∑i=1neλi(Q), where λ1(Q),λ2(Q),…,λn(Q) are the eigenvalues of the signless Laplacian matrix of H. In this paper, we
Hongyan Lu, Zhongxun Zhu
doaj +1 more source
On Maximum Signless Laplacian Estrada Indices of Graphs with Given Parameters [PDF]
, 2014 Signless Laplacian Estrada index of a graph $G$, defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$, where $q_1, q_2, \cdots, q_n$ are the eigenvalues of the matrix $\mathbf{Q}(G)=\mathbf{D}(G)+\mathbf{A}(G)$. We determine the unique graphs with maximum signless
Ellahi, H. R. +3 more
core
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source
Bicyclic graphs with exactly two main signless Laplacian eigenvalues [PDF]
, 2013 A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero.
Deng, Hanyuan, Huang, He
core