Results 41 to 50 of about 858 (123)

Spectra of the extended neighborhood corona and extended corona of two graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2016
In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively.
Chandrashekar Adiga   +2 more
doaj   +1 more source

Aα‐Spectral Characterizations of Some Joins

open access: yesJournal of Mathematics, Volume 2020, Issue 1, 2020., 2020
Let G be a graph with n vertices. For every real α ∈ [0,1], write Aα(G) for the matrix Aα(G) = αD(G) + (1 − α)A(G), where A(G) and D(G) denote the adjacency matrix and the degree matrix of G, respectively. The collection of eigenvalues of Aα(G) together with multiplicities are called the Aα‐spectrum of G.
Tingzeng Wu, Tian Zhou, Naihuan Jing
wiley   +1 more source

On the Spectra of Commuting and Non Commuting Graph on Dihedral Group

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2017
Study about spectra of graph has became interesting work as well as study about commuting and non commuting graph of a group or a ring. But the study about spectra of commuting and non commuting graph of dihedral group has not been done yet.
Abdussakir Abdussakir   +2 more
doaj   +1 more source

Spectra of the neighbourhood corona of two graphs

open access: yes, 2013
Given simple graphs $G_1$ and $G_2$, the neighbourhood corona of $G_1$ and $G_2$, denoted $G_1\star G_2$, is the graph obtained by taking one copy of $G_1$ and $|V(G_1)|$ copies of $G_2$, and joining the neighbours of the $i$th vertex of $G_1$ to every ...
Liu, Xiaogang, Zhou, Sanming
core   +1 more source

On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs

open access: yes, 2015
In order to investigate the non-odd-bipartiteness of even uniform hypergraphs, starting from a simple graph $G$, we construct a generalized power of $G$, denoted by $G^{k,s}$, which is obtained from $G$ by blowing up each vertex into a $k$-set and each ...
Fan, Yi-Zheng, Khan, Murad-ul-Islam
core   +1 more source

Spectrum of the Cozero-Divisor Graph Associated to Ring Zn

open access: yesAxioms, 2023
Let R be a commutative ring with identity 1≠0 and let Z(R)′ be the set of all non-unit and non-zero elements of ring R. Γ′(R) denotes the cozero-divisor graph of R and is an undirected graph with vertex set Z(R)′, w∉zR, and z∉wR if and only if two ...
Mohd Rashid   +3 more
doaj   +1 more source

Laplacian matrices of weighted digraphs represented as quantum states

open access: yes, 2017
Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study.
Adhikari, Bibhas   +3 more
core   +1 more source

The extremal spectral radii of $k$-uniform supertrees

open access: yes, 2014
In this paper, we study some extremal problems of three kinds of spectral radii of $k$-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $Q$-spectral radius). We call a connected and acyclic $k$
Li, Honghai, Qi, Liqun, Shao, Jiayu
core   +1 more source

On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

open access: yesMathematics, 2021
The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur   +3 more
doaj   +1 more source

The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs

open access: yes, 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

Home - About - Disclaimer - Privacy