Results 61 to 70 of about 858 (123)

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, B. R. Rakshith, K. N. Prakasha, N. V. Sayinath Udupa, Abdul Rauf Khan   +4 more
wiley   +1 more source

On the signless Laplacian spectrum of k -uniform hypergraphs

Linear and Multilinear Algebra
Let $\mathcal{H}$ be a connected $k$-uniform hypergraph on $n$ vertices and $m$ hyperedges. In [A.~Banerjee, On the spectrum of hypergraph, Linear Algebra and its Application, 614(2021), 82--110], Anirban Banerjee introduced a new adjacency matrix for hypergraphs.
Bapat, R. B., Saha, S. S., Panda, S. K.
openaire   +2 more sources

On the reduced signless Laplacian spectrum of a degree maximal graph

Linear Algebra and its Applications, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tam, Bit-Shun, Wu, Shu-Hui
openaire   +1 more source

Bounds of signless Laplacian spectrum of graphs based on the k -domination number

Linear Algebra and its Applications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Huiqing, Lu, Mei
openaire   +1 more source

Energy, Laplacian energy of double graphs and new families of equienergetic graphs [PDF]

, 2013
For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \cdots, v_n\}$, the extended double cover $G^*$ is a bipartite graph with bipartition (X, Y), $X=\{x_1, x_2, \cdots, x_n\}$ and $Y=\{y_1, y_2, \cdots, y_n\}$, where two vertices $x_i$ and $y_j$ are ...
A Ganie, Hilal, S. Pirzada
core  

Determining some graph joins by the signless Laplacian spectrum

Discrete Applied Mathematics
A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the complete bipartite graph with $l$ vertices, respectively.
Jiachang Ye, Jianguo Qian, Zoran Stanić
openaire   +2 more sources

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., Dever, S., Lovitz, B, Myer, J., Tamon, C., Xu, Y., Zhan, H.   +6 more
core  

Laplacian Distribution and Domination [PDF]

, 2016
Let $m_G(I)$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$, and let $\gamma(G)$ denote its domination number. We extend the recent result $m_G[0,1) \leq \gamma(G)$, and show that isolate-free graphs also satisfy $\gamma(G) \
Cardoso, Domingos M., Jacobs, David P., Trevisan, Vilmar   +2 more
core   +2 more sources

Resistance Distance and Kirchhoff Index of the Corona-Vertex and the Corona-Edge of Subdivision Graph

IEEE Access, 2018
The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj   +1 more source

Signless laplacian spectral characterization of roses

Kuwait Journal of Science, 2020
A p-rose graph Γ = RG(a3, a4, . . . , as) is a graph consisting of p =a3 + a4 + · · · + as ≥ 2 cycles that all meet in one vertex, and ai (3 ≤ i ≤ s) is the number of cycles in Γ of length i.
ALI ZEYDI ABDIAN, ALI REZA ASHRAFI, Maurizion Brunetti   +2 more
doaj