Results 51 to 60 of about 1,271 (139)

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

A Note on the Spectral Radius of Weighted Signless Laplacian Matrix

open access: yesAdvances in Linear Algebra & Matrix Theory, 2018
A weighted graph is a graph that has a numeric label associated with each edge, called the weight of edge. In many applications, the edge weights are usually represented by nonnegative integers or square matrices. The weighted signless Laplacian matrix of a weighted graph is defined as the sum of adjacency matrix and degree matrix of same weighted ...
KAYA GÖK, GÜLİSTAN   +2 more
openaire   +3 more sources

On the sum of signless Laplacian spectra of graphs

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
For a simple graph $G(V,E)$ with $n$ vertices, $m$ edges, vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$ and edge set $E(G)=\{e_1, e_2,\dots, e_m\}$, the adjacency matrix $A=(a_{ij})$ of $G$ is a $(0, 1)$-square matrix of order $n$ whose $(i,j)$-entry is ...
S. Pirzada, H.A. Ganie, A.M. Alghamdi
doaj   +1 more source

On Some Properties of Characteristics Polynomials of the Complete Graphs Kn [PDF]

open access: yesEngineering and Technology Journal, 2013
This paper discusses the properties of the characteristic polynomial of the complete graphs Kn, n=1, 2… respective to the adjacency matrices. Two different types of matrices, the adjacency matrix and the signless Laplacian matrix, are presented.
Nuha A. Rajab   +2 more
doaj   +1 more source

On the Signless Laplacian Spectral Radius of Graphs without Small Books and Intersecting Quadrangles

open access: yesMathematics, 2022
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do not contain small books as a subgraph and characterize all extremal graphs. In addition, we give an upper bound of the signless Laplacian spectral radius of
Ming-Zhu Chen   +3 more
doaj   +1 more source

Universal adjacency spectrum of zero divisor graph on the ring and its complement

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A and
Saraswati Bajaj, Pratima Panigrahi
doaj   +1 more source

A graph theoretical approach to states and unitary operations

open access: yes, 2016
Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian matrix, what ...
Adhikari, Bibhas   +2 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

Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph

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

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