scholarly journals Characteristic polynomial and eigenvalues of the anti-adjacency matrix of cyclic directed prism graph

2019 ◽  
Author(s):  
R. Stin ◽  
S. Aminah ◽  
S. Utama
Keyword(s):  
Characteristic Polynomial ◽  
Adjacency Matrix ◽  
Prism Graph

scholarly journals The normalized distance Laplacian

2021 ◽  
Vol 9 (1) ◽  
pp. 1-18
Author(s):  
Carolyn Reinhart
Keyword(s):  
Spectral Radius ◽  
Characteristic Polynomial ◽  
Adjacency Matrix ◽  
Connected Graph ◽  
Distance Matrix ◽  
Laplacian Matrix ◽  
Diagonal Matrix ◽  
The Matrix

Abstract The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of transmissions of the vertices of the graph. The normalized distance Laplacian, 𝒟𝒧(G) = I−T(G)−1/2 𝒟(G)T(G)−1/2, is introduced. This is analogous to the normalized Laplacian matrix, 𝒧(G) = I − D(G)−1/2 A(G)D(G)−1/2, where D(G) is the diagonal matrix of degrees of the vertices of the graph and A(G) is the adjacency matrix. Bounds on the spectral radius of 𝒟 𝒧 and connections with the normalized Laplacian matrix are presented. Twin vertices are used to determine eigenvalues of the normalized distance Laplacian. The distance generalized characteristic polynomial is defined and its properties established. Finally, 𝒟𝒧-cospectrality and lack thereof are determined for all graphs on 10 and fewer vertices, providing evidence that the normalized distance Laplacian has fewer cospectral pairs than other matrices.

scholarly journals Spectral Properties with the Difference between Topological Indices in Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Akbar Jahanbani ◽  
Roslan Hasni ◽  
Zhibin Du ◽  
Seyed Mahmoud Sheikholeslami
Keyword(s):  
Characteristic Polynomial ◽  
Lower Bounds ◽  
Adjacency Matrix ◽  
Spectral Properties ◽  
Main Tool ◽  
Topological Indices ◽  
Upper And Lower Bounds ◽  
New Energy ◽  
Energy Of Graph ◽  
The Difference

Let G be a graph of order n with vertices labeled as v1,v2,…,vn. Let di be the degree of the vertex vi, for i=1,2,…,n. The difference adjacency matrix of G is the square matrix of order n whose i,j entry is equal to di+dj−2−1/didj if the vertices vi and vj of G are adjacent or vivj∈EG and zero otherwise. Since this index is related to the degree of the vertices of the graph, our main tool will be an appropriate matrix, that is, a modification of the classical adjacency matrix involving the degrees of the vertices. In this paper, some properties of its characteristic polynomial are studied. We also investigate the difference energy of a graph. In addition, we establish some upper and lower bounds for this new energy of graph.

scholarly journals Signless Laplacian Polynomial and Characteristic Polynomial of a Graph

2013 ◽  
Vol 2013 ◽  
pp. 1-4 ◽  
Author(s):  
Harishchandra S. Ramane ◽  
Shaila B. Gudimani ◽  
Sumedha S. Shinde
Keyword(s):  
Characteristic Polynomial ◽  
Regular Graph ◽  
Adjacency Matrix ◽  
Line Graph ◽  
Induced Subgraphs ◽  
Subdivision Graph ◽  
Signless Laplacian ◽  
The Matrix ◽  
Derivatives Of ◽  
Degree Matrix

The signless Laplacian polynomial of a graph G is the characteristic polynomial of the matrix Q(G)=D(G)+A(G), where D(G) is the diagonal degree matrix and A(G) is the adjacency matrix of G. In this paper we express the signless Laplacian polynomial in terms of the characteristic polynomial of the induced subgraphs, and, for regular graph, the signless Laplacian polynomial is expressed in terms of the derivatives of the characteristic polynomial. Using this we obtain the characteristic polynomial of line graph and subdivision graph in terms of the characteristic polynomial of induced subgraphs.

scholarly journals On the Characteristic Polynomial of $n$-Cayley Digraphs

10.37236/3105 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Majid Arezoomand ◽  
Bijan Taeri
Keyword(s):  
Cayley Graph ◽  
Characteristic Polynomial ◽  
Adjacency Matrix ◽  
Cayley Graphs ◽  
Irreducible Representations ◽  
Cayley Digraph ◽  
Semiregular Subgroup

A digraph $\Gamma$ is called $n$-Cayley digraph over a group $G$‎, ‎if there exists a semiregular subgroup $R_G$ of Aut$(\Gamma)$ isomorphic to $G$ with $n$ orbits‎. ‎In this paper‎, ‎we represent the adjacency matrix of $\Gamma$ as a diagonal block‎ ‎matrix in terms of irreducible representations of $G$ and determine its characteristic polynomial‎. ‎As corollaries of this result we find‎:  ‎the spectrum of  semi-Cayley graphs over abelian groups‎, ‎a relation between the characteristic polynomial of an $n$-Cayley graph and its complement‎, ‎and   the spectrum of‎ ‎Calye graphs over groups with cyclic subgroups‎. ‎Finally we determine the eigenspace of $n$-Cayley digraphs and their main eigenvalues‎.

Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph

1992 ◽  
Vol 1 (1) ◽  
pp. 13-25 ◽  
Author(s):  
C. D. Godsil
Keyword(s):  
Orthogonal Polynomials ◽  
Characteristic Polynomial ◽  
Generating Functions ◽  
Adjacency Matrix ◽  
Characteristic Polynomials ◽  
Combinatorial Interpretation ◽  
Determinantal Identity

In this work we show that that many of the basic results concerning the theory of the characteristic polynomial of a graph can be derived as easy consequences of a determinantal identity due to Jacobi. As well as improving known results, we are also able to derive a number of new ones. A combinatorial interpretation of the Christoffel-Darboux identity from the theory of orthogonal polynomials is also presented. Finally, we extend some work of Tutte on the reconstructibility of graphs with irreducible characteristic polynomials.

scholarly journals Characteristic Polynomials of Skew-Adjacency Matrices of Oriented Graphs

10.37236/643 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Yaoping Hou ◽  
Tiangang Lei
Keyword(s):  
Characteristic Polynomial ◽  
Directed Graph ◽  
Adjacency Matrix ◽  
Undirected Graph ◽  
Oriented Graph ◽  
Bipartite Graphs ◽  
Characteristic Polynomials ◽  
Oriented Graphs ◽  
Underlying Graph ◽  
Skew Adjacency Matrix

An oriented graph $\overleftarrow{G}$ is a simple undirected graph $G$ with an orientation, which assigns to each edge a direction so that $\overleftarrow{G}$ becomes a directed graph. $G$ is called the underlying graph of $\overleftarrow{G}$ and we denote by $S(\overleftarrow{G})$ the skew-adjacency matrix of $\overleftarrow{G}$ and its spectrum $Sp(\overleftarrow{G})$ is called the skew-spectrum of $\overleftarrow{G}$. In this paper, the coefficients of the characteristic polynomial of the skew-adjacency matrix $S(\overleftarrow{G}) $ are given in terms of $\overleftarrow{G}$ and as its applications, new combinatorial proofs of known results are obtained and new families of oriented bipartite graphs $\overleftarrow{G}$ with $Sp(\overleftarrow{G})={\bf i} Sp(G) $ are given.

scholarly journals Alpha Adjacency: A generalization of adjacency matrices

2019 ◽  
Vol 35 ◽  
pp. 365-375
Author(s):  
Matt Hudelson ◽  
Judi McDonald ◽  
Enzo Wendler
Keyword(s):  
Characteristic Polynomial ◽  
Adjacency Matrix ◽  
Undirected Graph ◽  
Arbitrary Field ◽  
Characteristic Polynomials ◽  
Average Characteristic ◽  
Adjacency Matrices ◽  
Skew Adjacency Matrix

B. Shader and W. So introduced the idea of the skew adjacency matrix. Their idea was to give an orientation to a simple undirected graph G from which a skew adjacency matrix S(G) is created. The -adjacency matrix extends this idea to an arbitrary field F. To study the underlying undirected graph, the average -characteristic polynomial can be created by averaging the characteristic polynomials over all the possible orientations. In particular, a Harary-Sachs theorem for the average-characteristic polynomial is derived and used to determine a few features of the graph from the average-characteristic polynomial.

Sign in / Sign up

Export Citation Format

Share Document