Adjacency Matrix of Product of Graphs
|
|
- Bathsheba Strickland
- 5 years ago
- Views:
Transcription
1 Kalpa Publications in Computing Volume 2, 2017, Pages ICRISET2017 International Conference on Research and Innovations in Science, Engineering &Technology Selected Papers in Computing Adjacency Matrix of Product of Graphs H S Mehta 1 and U P Acharya 2 1 Department of Mathematics, Sardar Patel University, V V Nagar, Anand,Gujarat India hs mehta@spuvvnedu 2 Applied Sciences and Humanities Department, A D Patel Institute of Technology, Karamsad, Gujarat, India mathsurvashi@aditacin Abstract In graph theory, different types of matrices associated with graph, eg Adjacency matrix, Incidence matrix, Laplacian matrix etc Among all adjacency matrix play an important role in graph theory Many products of two graphs as well as its generalized form had been studied, eg, cartesian product, 2 cartesian product, tensor product, 2 tensor product etc In this paper, we discuss the adjacency matrix of two new product of graphs G H, where = 2, 2 Also, we obtain the spectrum of these products of graphs Keywords:- 2 cartesian product, 2 tensor product, adjacency matrix and spectrum 2010 Mathematics Subject Classification:- 05C50, 05C76 1 Introduction Graph theory, no doubt, is the fast growing area of combinatory Because of its inherent simplicity Graph theory has a wide range of applications in Computer Science, Sociology, bio-informatics, medicines etc There are different type of product of graphs eg, cartesian product, tensor product etc defined in graph theory There are many matrices associated with graphs like adjacency matrix, incidence matrix, Laplacian matrix etc One of them is adjacency matrix It is well- known that these product operation on graphs and product of adjacency matrices are related ([6], [9]) We have generalized well-known two products, cartesian product and tensor product with the help of concept of distance In this direction, we have defined 2 cartesian product G 2 H and 2 tensor product G 2 H of graphs G and H ([1], [2], [3]) Let G = (V(G),E(G)) be a finite and simple graph For a connected graph G, d G (u,u ) is the length of the shortest path between u and u in G A graph is r regular if every vertex of G has degree r For the basic terminology, concepts and results of graph theory, we refer to ([5], [8]) The Kronecker product A B of two matrices A and B has been defined and discussed in [6] R Buyya, R Ranjan, S Dutta Roy, M Raval, M Zaveri, H Patel, A Ganatra, DG Thakore, TA Desai, ZH Shah, NM Patel, ME Shimpi, RB Gandhi, JM Rathod, BC Goradiya, MS Holia and DK Patel (eds), ICRISET2017 (Kalpa Publications in Computing, vol 2), pp
2 Definition 11 Let A = [a ij ] and B = [b ij ] be in M m n (IR) Then the Kronecker product of A and B, denoted by A B is defined as the partitioned matrix [a ij B], a 11 B a 12 B a 1n B a 21 B a 22 B a 2n B A B = [a ij B] = a m1 B a m2 B a mn B Note that it has mn blocks, where ij th block is the block matrix a ij B of order m n Let X = [x 1,x 2,,x n ] T and Y = [y 1,y 2,,y n ] T be column vectors Then by definition of the kronecker product, we have X Y = [ ] T [ ] T x 1 Y x 2 Y x n Y = x1 y 1 x 1 y m x n y 1 x n y m Definition 12 [6] Let A = [a ij ] and B = [b ij ] be in M m n (IR) Then the Kronecker sum of A and B, denoted by A B and defined as A B = (A I m )+(I n B) Definition 13 [9] Let G = (V,E) be a simple graph with the vertex set u 1,u 2,u n } Then the adjacency matrix A(G) = [a ij ] is defined as follows: a ij = 1; if dg (u i,u j ) = 1 0; otherwise Then A(G) is a real, square symmetric matrix Next, we recall the definitions of 2 tensor product and 2 cartesian product of graphs as follows: Definition 14 [2] Let G = (U,E 1 ) and H = (V,E 2 ) be two connected graphs The 2 tensor product G 2 H of G and H is the graph with vertex set U V and two vertices (u,v) and (u,v ) in V(G 2 H) are adjacent in 2 tensor product if d G (u,u ) = 2 and d H (v,v ) = 2 Note that if d G (u,u ) = 1 = d H (v,v ), then it is the usual tensor product G H of G and H Definition 15[3] Let G = (U,E 1 ) andh = (V,E 2 ) be twoconnectedgraphs The 2 cartesian product G 2 H of G and H is the graph with vertex set U V and two vertices (u,v) and (u,v ) in V(G 2 H) are adjacent if one of the following conditions is satisfied: (i) d G (u,u ) = 2 and d H (v,v ) = 0, (ii) d G (u,u ) = 0 and d H (v,v ) = 2 Note that in the above condition (i) and condition (ii), 2 replace by 1, then it is the usual cartesian product G H of G and H It is clear that the definition of A(G) is in terms of adjacent vertices, ie, vertices at distance 1 For the graphs G H, we use 2 distance between vertices So, we require to consider the second stage adjacency matrix 159
3 Definition 16 [4] Let G = (V,E) be a simple graph with the vertex set u 1,u 2,u n } The second stage adjacency matrix A 2 (G) = [a ij ] is defined as follows: a ij = 1; if dg (u i,u j ) = 2 0; otherwise Note that A 2 (G) is a real, square symmetric matrix 2 Adjacency matrix of G H In this section, we discuss adjacency matrix of G 2 H and G 2 H of graphs G and H Adjacency matrix of usual tensor product and cartesian product of graphs can be obtained as follows Proposition 21 [9] Let G and H be simple graphs with n and m vertices respectively Then (i) A(G H) = A(G) A(H) (ii) A(G H) = (A(G) I m )+(I n A(H)) Next, we prove the result similar to Proposition 21 for G 2 H and G 2 H Proposition 22 Let G and H be connected graphs with n and m vertices respectively Then A(G 2 H) = A 2 (G) A 2 (H) Proof: Let V(G) = u 1,u 2,,u n } and V(H) = v 1,v 2,,v m } A 11 A 12 A 1s A 1n Let A(G 2 H) = A r1 A r2 A rs A rn A n1 A n2 A ns A nn Where A r,s = (u s,v 1) (u s,v 2) (u s,v m) (u r,v 1) P 11 P 12 P 1m (u r,v m) P m1 P m2 P mm Suppose d G (u r,u s ) 2, then A rs is a zero matrix of order m m Suppose d G (u r,u s ) = 2, then P ij = 1; if dh (v i,v j ) = 2 0; otherwise 160
4 Thus, in this case, P ij = (ij) th entry of A 2 (H) So, A rs = A2 (H); if d G (u r,u s ) = 2 0; otherwise Now let A 2 (G) = [b ij ] n n and A 2 (H) = [c ij ] m m Then b 11 A 2 (H) b 1n A 2 (H) A 2 (G) A 2 (H) = b n1 A 2 (H) b nn A 2 (H) So, (ij) th block of A 2 (G) A 2 (H) is the block matrix b ij A 2 (H) of order m m Then the block matrix [b ij A 2 (H)] = A2 (H); if b ij = 1, ie, d G (u i,u j ) = 2 = [A ij ] Therefore, [b ij A 2 (H)] = (ij) th block of A(G 2 H) So, A(G 2 H) = A 2 (G) A 2 (H) Proposition 23 Let G and H be connected graphs with n and m vertices respectively Then A(G 2 H) = [A 2 (G) I m ]+[I n A 2 (H)] Proof: Suppose V(G) = u 1,u 2,,u n } and V(H) = v 1,v 2,,v n } Then consider A(G 2 H) and A rs same as given in Proposition 22 Suppose d G (u r,u s ) = 0 Then P ij = 1; if dh (v i,v j ) = 2 0; if d H (v i,v j ) 2 Suppose d G (u r,u s ) = 2 Then P ij = 1; if i = j 0; if i j Also, suppose d G (u r,u s ) 0 or 2 Then A r,s is a zero matrix of order m m Thus, A 2 (H); if d G (u r,u s ) = 0 A rs = I m ; if d G (u r,u s ) = 2 Next, A 2 (G) = [b ij ] n n and A 2 (H) = [c ij ] m m Then b 11 I m b 12 I m b 1n I m A 2 (G) I m = b n1 I m b n2 I m b nn I m 161
5 So,(ij) th block ofa 2 (G) I m = [b ij I m ] and [b ij I m ] = Im ; if b ij = 1,ie,d G (u i,u j ) = 2 In particular b ii I m = 0 m m A 2 (H) 0 0 I n A 2 (H) = 0 0 A 2 (H) Therefore (ij) th block of I n A 2 (H) is as follows: I n A 2 (H) = A2 (H); if i = j Suppose (ij) th block of [A 2 (G) I m ] [I n A 2 (H)] = B Then A 2 (H); i = j; ie, d G (u i,u j ) = 0 B = I m ; i j with d G (u i,u j ) = 2 Therefore (ij) th block of [A 2 (G) I m ]+[I n A 2 (H)] = (ij) th block of A(G 2 H) Thus, [A 2 (G) I m ]+[I n A 2 (H)] = A(G 2 H) 3 Spectrum of G H In this section, first we recall the spectrum of the graph G We discuss the spectrum of product graphs in terms of spectrum of factor graphs Definition 31 [5] For a matrix A M n n (R), a number λ is an eigenvalue if for some vector X 0, AX = λx The vector X is called an eigenvector corresponding to λ The set of all eigenvalues is the Spectrum of A, and it is denoted by Spec(A), ie, Spec(A) = λ C : λi A = 0} Note that the eigenvalue of G is the eigenvalue of its adjacency matrix A(G) and the spectrum of G is denoted by Spec(A(G)) The following result is known in the usual tensor product A B of matrices A and B as well as in usual tensor product G H of graphs G and H Proposition 32 [9] (i) Let A and B be two square matrices Spec(A B) = λ µ : λ Spec(A), µ Spec(B)} (ii) If G and H are two graphs with n and m vertices respectively, then, Spec(A(G H)) = λµ : λ Spec(A(G)),µ Spec(A(H))} Using Proposition 32(i), we get result similar to (ii) for G 2 H Proposition 33 Let G and H be two graphs with n and m vertices respectively Then, Spec(A(G 2 H)) = λ µ : λ Spec(A 2 (G)), µ Spec(A 2 (H))} 162
6 Proof: Let λ Spec(A(G)) and µ Spec(A(H)) Let X = [x 1,x 2,,x n ] T and Y = [y 1,y 2,,y m ] T be eigenvectorscorrespondingto eigenvalues λ and µ of A 2 (G) and A 2 (H) respectively So, A 2 (G)X = λx and A 2 (H)Y = µy Using kronecker product, we have (A 2 (G)X) (A 2 (H)Y) = (λx) (µy) Therefore (A 2 (G) (A 2 (H))(X Y) = λ µ(x Y) By Proposition 22, we get A(G 2 H)(X Y) = λ µ(x Y) Thus λ µ is an eigenvalue with X Y as an eigenvector of A(G 2 H) The following result is known in the usual cartesian product G H of graphs Proposition 34 [9] (i) Let A and B be two matrices Spec(A B) = λ +µ : λ Spec(A), µ Spec(B)} (ii) If G and H are two graphs with n and m vertices respectively, then, Spec(A(G H)) = λ+µ : λ Spec(A(G)), µ Spec(A(H))} Using Proposition 34 (i), we get result similar to (ii) for G 2 H Proposition 35 Let G and G be two graphs with n and m vertices respectively Then, Spec(A(G 2 H)) = Spec(A 2 (G)) + Spec(A 2 (H)) Proof: Let λ Spec(A 2 (G)) and µ Spec(A 2 (H)) Let X = [x 1,x 2,,x n ] T and Y = [y 1,y 2,,y m ] T be eigenvectorscorrespondingto eigenvalues λ and µ of A 2 (G) and A 2 (H) respectively So, A 2 (G)X = λx and A 2 (H)Y = µy Using kronecker sum, by Proposition 23, we have A 2 (G) A 2 (H) = [A 2 (G) I m ]+[I n A 2 (H)] = A(G 2 H) Therefore A(G 2 H) (X Y) = [A 2 (G) I m ]+[I n A 2 (H)]} (X Y) = [A 2 (G) X I m Y]+[I n X A 2 (H) Y] = [λ X I m Y]+[I n X µ Y] = (λ+µ)(x Y) Thus λ+µ is an eigenvalue with X Y as an eigenvector of A(G 2 H) 4 spectrum of G H in terms of A(G) and A(H) In this section, we find the relation between A 2 (G) and A 2 (G), where A 2 (G) is A(G)A(G), usual matrix multiplication of A(G) with A(G) The degree diagonal matrix D(G) is defined as follows: Definition 412 [9] Let G = (V,E) be a graph with vertex set u 1,u 2,,u n } Then the degree diagonal matrix D(G) = [d ij ] n n is defined as d ij = deg(u i )δ ij = deg(ui ); if i = j Proposition 42 Let G be a simple connected, triangle free and square free graph Then A 2 (G) = A 2 (G) D(G) Proof: Let G be a graph with vertex set u 1,u 2,,u n } Now, A 2 (G) = [c ij ], where c ij = n k=1 a ik a kj ;1 i,j n 163
7 Suppose i j If c ij 0, then for some values of k, a ik and a kj both are non zero, ie, u i is adjacent to u k and u k is adjacent to u j in G Next, if u i u k and u k u j, then u i can not be adjacent with u j in G, as G is a triangle free graph So, u i u k u j gives d G (u i,u j ) = 2 Since G is a square free graph, there is a unique path between u i and u j of length 2 So, for at most one k, a ik and a kj both are non zero Thus c ij = 1, if d G (u i,u j ) = 2 and c ij = 0, otherwise Also, it is known that c ii = deg(u i ) = d ii Thus, A 2 (G) = A 2 (G) D(G) Note that A 2 (G) is a real symmetric binary matrix Remarks 43 (i) Let G be connected but not a triangular free graph Suppose u i u k u j u i is a triangle in G, Then d G (u i,u k ) = 1 = d G (u k,u j ) So, (ij) th entry of A 2 (G) is 1 but (ij) th entry of A 2 (G) is 0, as d G (u i,u j ) 2 Therefore A 2 (G) A 2 (G) D(G) (ii) If G is connected but not a square free graph, then there may be more than one path between two vertices, say u i and u j of length two Then (ij) th entry of A 2 (G) is 2 but (ij) th entry of A 2 (G) is 1 So, A 2 (G) A 2 (G) D(G) Corollary 44 If G ia a k regular graph, triangularfree and square free graph with n vertices, then A 2 (G) = A 2 (G) ki n Consequently, Spec(A 2 (G)) = λ 2 k : λ Spec(A(G))} For example, if G = C n, n 5, then A 2 (C n ) = A 2 (C n ) 2I n In next discussion we fix both the graphs G and H connected, triangular free and square free graphs with n and m vertices respectively Proposition 45 Let G and H be connected graphs (i) A(G 2 H) = [ A 2 (G) A 2 (H) ] [ A 2 (G) D(H) ] [ D(G) A 2 (H) ] +[D(G) D(H)] (ii) A(G 2 H) = [ A 2 (G) I m ] [D(G) Im ]+ [ I n A 2 (H) ] [I n D(H)] Proof: By Proposition 42, A 2 (G) = A 2 (G) D(G) and A 2 (H) = A 2 (H) D(H) (i) By Proposition 22, we have A(G 2 H) = A 2 (G) A 2 (H) So, A(G 2 H) = A 2 (G) A 2 (H) = [A 2 (G) D(G)] [A 2 (H) D(H)] = [ A 2 (G) A 2 (H) ] [ A 2 (G) D(H) ] [ D(G) A 2 (H) ] +[D(G) D(H)] (ii) ByProposition23,A(G 2 H) = [A 2 (G) I m ]+[I n A 2 (H)] Thenbysimilararguments as given in case (i), we get the result Finally, we obtained the spectrum of A(G H) in terms of SpecA(G) and SpecA(H) The following result is known in matrix theory Theorem 46 Let G be k regularand H be s regularconnected graphswith n and m vertices respectively Then Spec(A(G 2 H)) = (λ 2 k) (µ 2 s) : λ Spec(A(G))and µ Spec(A(H))} Proof: Let G and H be regular graphs of n, m vertices with regularity k and s respectively In addition let X be an eigenvector corresponding to eigenvalue λ of G and Y be an eigenvector corresponding to eigenvalue µ of H So, A(G)X = λx and A(H) = µy Also D(G) = ki n and D(H) = si m 164
8 From Proposition 45, we have A(G 2 H) (X Y) = [ A 2 (G) A 2 (H) ] (X Y) [ A 2 (G) D(H) ] (X Y) [ D(G) A 2 (H) ] (X Y) +[D(G) D(H)](X Y) = [ A 2 (G)X A 2 (H)Y ] [ A 2 (G)X D(H)Y ] [ D(G)X A 2 (H)Y ] +[D(G)X D(H)Y] = [ λ 2 X µ 2 Y ] [ λ 2 X si m Y ] [ ki n X µ 2 Y ] +[ki n X si m Y] = [ λ 2 X µ 2 Y ] [ λ 2 X sy ] [ kx µ 2 Y ] +[kx s Y] = [ λ 2 µ 2] (X Y) [ λ 2 s ] (X Y) [ kµ 2] (X Y)+[ks] (X Y) = [ λ 2 µ 2 λ 2 s kµ 2 +k s ] (X Y) = [ (λ 2 k) (µ 2 s) ] (X Y) Thus, Spec(A(G 2 H)) = (λ 2 k)(µ 2 s) : λ Spec(A(G)) and µ Spec(A(H))} Proposition 47 Let G and H be k regular and H be s regular connected graphs of n, m vertices respectively Then Spec(A(G 2 H)) = (λ 2 k) + (µ 2 s) : λ Spec(A(G)),µ Spec(A(H))} Proof: We continue the notations of Theorem 48 Also using Proposition 46, we have A(G 2 H) (X Y) = [A 2 (G) I m ]+[I n A 2 (H)] [D(G) I m ] [I n D(H)]} (X Y) = [A 2 (G) X I m Y]+[I n X A 2 (H) Y] [D(G)X I m Y] [I n X D(H)Y] = [λ 2 X I m Y]+[I n X µ 2 Y] [kx Y] [X sy] = ((λ 2 k)+(µ 2 s))(x Y) Thus, Spec(A(G 2 H)) = (λ 2 k)+(µ 2 s) : λ Spec(A(G)),µ Spec(A(H))} Acknowledgment The research is supported by the SAP programmed to Department of Mathematics, S P University, Vallabh Vidyanagr, by UGC References [1] U P Acharya and H S Mehta, 2- Cartesian Product of Special Graphs, Int J of Math and Soft Comp, Vol4, No1, (2014), [2] U P Acharya and H S Mehta, 2 - tensor Product of special Graphs, Int J of Math and Scietific Comp, Vol4(1), (2014), [3] U P Acharya and H S Mehta, Generalized Cartesian product of Graphs, Int J of Math and Scietific Comp, Vol5(1), (2015), 4-7 [4] S K Ayyaswamy, S Balachandran and I Gutman, On Second Stage Spectrum and Energy of a Graph, Kragujevac J of Math 34, (2010), [5] R Balakrishnan and K Ranganathan, A Text book of Graph Theory, Universitext, Second Edition, Springer, New York, 2012 [6] R B Bapat: Graphs and Matrices, Second Edition, Springer-Verlag, London and Hindistan Book Agency, India, 2011 [7] C Godsil and G F Royle: Algebraic Graph Theory, Springer-Verlag, New York, 2001 [8] Richard Hammack, Wilfried Imrich and Sandi Klavzar, Hand book of product Graphs, CRC Press, Taylor & Francis Group, 2 nd edition, New York, 2011 [9] D M Cvetkovic, M Doob and H Sachs, Spectra of Graphs, Academic Press, New York,
Fixed Point Analysis of Kermack Mckendrick SIR Model
Kalpa Publications in Computing Volume, 17, Pages 13 19 ICRISET17. International Conference on Research and Innovations in Science, Engineering &Technology. Selected Papers in Computing Fixed Point Analysis
More informationDeterminant of the distance matrix of a tree with matrix weights
Determinant of the distance matrix of a tree with matrix weights R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract Let T be a tree with
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationAnalysis of Periodic Orbits with Smaller Primary As Oblate Spheroid
Kalpa Publications in Computing Volume 2, 2017, Pages 38 50 ICRISET2017. International Conference on Research and Innovations in Science, Engineering &Technology. Selected Papers in Computing Analysis
More informationRadial eigenvectors of the Laplacian of the nonbinary hypercube
Radial eigenvectors of the Laplacian of the nonbinary hypercube Murali K. Srinivasan Department of Mathematics Indian Institute of Technology, Bombay Powai, Mumbai 400076, INDIA mks@math.iitb.ac.in murali.k.srinivasan@gmail.com
More informationLAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
Kragujevac Journal of Mathematics Volume 39() (015), Pages 193 05. LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1,
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationLecture 1: Graphs, Adjacency Matrices, Graph Laplacian
Lecture 1: Graphs, Adjacency Matrices, Graph Laplacian Radu Balan January 31, 2017 G = (V, E) An undirected graph G is given by two pieces of information: a set of vertices V and a set of edges E, G =
More informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More informationARTICLE IN PRESS European Journal of Combinatorics ( )
European Journal of Combinatorics ( ) Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Proof of a conjecture concerning the direct
More informationarxiv: v4 [math.co] 12 Feb 2017
arxiv:1511.03511v4 [math.co] 12 Feb 2017 On the signed graphs with two distinct eigenvalues F. Ramezani 1 Department of Mathematics, K.N.Toosi University of Technology, Tehran, Iran P.O. Box 16315-1618
More informationEnergies of Graphs and Matrices
Energies of Graphs and Matrices Duy Nguyen T Parabola Talk October 6, 2010 Summary 1 Definitions Energy of Graph 2 Laplacian Energy Laplacian Matrices Edge Deletion 3 Maximum energy 4 The Integral Formula
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationNew Results on Equienergetic Graphs of Small Order
International Journal of Computational and Applied Mathematics. ISSN 1819-4966 Volume 12, Number 2 (2017), pp. 595 602 Research India Publications http://www.ripublication.com/ijcam.htm New Results on
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research education use, including for instruction at the authors institution
More informationNormalized Laplacian spectrum of two new types of join graphs
Journal of Linear and Topological Algebra Vol. 6, No. 1, 217, 1-9 Normalized Laplacian spectrum of two new types of join graphs M. Hakimi-Nezhaad a, M. Ghorbani a a Department of Mathematics, Faculty of
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationOn marker set distance Laplacian eigenvalues in graphs.
Malaya Journal of Matematik, Vol 6, No 2, 369-374, 2018 https://doiorg/1026637/mjm0602/0011 On marker set distance Laplacian eigenvalues in graphs Medha Itagi Huilgol1 * and S Anuradha2 Abstract In our
More informationEigenvalues of the Adjacency Tensor on Products of Hypergraphs
Int. J. Contemp. Math. Sciences, Vol. 8, 201, no. 4, 151-158 HIKARI Ltd, www.m-hikari.com Eigenvalues of the Adjacency Tensor on Products of Hypergraphs Kelly J. Pearson Department of Mathematics and Statistics
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationThe spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationD-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS
123 Kragujevac J. Math. 32 (2009) 123 131. D-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS Gopalapillai Indulal 1 and Ivan Gutman 2 1 Department of Mathematics, St. Aloysius College, Edathua, Alappuzha 689573,
More informationNew skew Laplacian energy of a simple digraph
New skew Laplacian energy of a simple digraph Qingqiong Cai, Xueliang Li, Jiangli Song arxiv:1304.6465v1 [math.co] 24 Apr 2013 Center for Combinatorics and LPMC-TJKLC Nankai University Tianjin 300071,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 99 111 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On weighted directed
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 435 (2011) 1029 1033 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Subgraphs and the Laplacian
More informationLAPLACIAN ENERGY FOR A BALANCED GRAPH
LAPLACIAN ENERGY FOR A BALANCED GRAPH Dr. K. Ameenal Bibi 1, B. Vijayalakshmi 2 1,2 Department of Mathematics, 1,2 D.K.M College for Women (Autonomous), Vellore 632 001, India Abstract In this paper, we
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationSummary: A Random Walks View of Spectral Segmentation, by Marina Meila (University of Washington) and Jianbo Shi (Carnegie Mellon University)
Summary: A Random Walks View of Spectral Segmentation, by Marina Meila (University of Washington) and Jianbo Shi (Carnegie Mellon University) The authors explain how the NCut algorithm for graph bisection
More informationThe Adjacency Matrix, Standard Laplacian, and Normalized Laplacian, and Some Eigenvalue Interlacing Results
The Adjacency Matrix, Standard Laplacian, and Normalized Laplacian, and Some Eigenvalue Interlacing Results Frank J. Hall Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 April 8, 2008 Outline 1 Introduction 2 Graphs and matrices
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More informationOn Hadamard Diagonalizable Graphs
On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationSEIDEL ENERGY OF ITERATED LINE GRAPHS OF REGULAR GRAPHS
Kragujevac Journal of Mathematics Volume 39(1) (015), Pages 7 1. SEIDEL ENERGY OF ITERATED LINE GRAPHS OF REGULAR GRAPHS HARISHCHANDRA S. RAMANE 1, IVAN GUTMAN, AND MAHADEVAPPA M. GUNDLOOR 3 Abstract.
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationProduct distance matrix of a tree with matrix weights
Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian
More informationMath 4377/6308 Advanced Linear Algebra
2.3 Composition Math 4377/6308 Advanced Linear Algebra 2.3 Composition of Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377
More informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More informationThe Local Spectra of Regular Line Graphs
The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I
More informationOn the Normalized Laplacian Energy(Randić Energy)
On the Normalized Laplacian Energy(Randić Energy) Selçuk University, Konya/Turkey aysedilekmaden@selcuk.edu.tr SGA 2016- Spectral Graph Theory and Applications May 18-20, 2016 Belgrade, SERBIA Outline
More informationELA A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS
A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS ABRAHAM BERMAN AND MIRIAM FARBER Abstract. Let G be a weighted graph on n vertices. Let λ n 1 (G) be the second largest eigenvalue
More informationarxiv: v1 [cs.ds] 11 Oct 2018
Path matrix and path energy of graphs arxiv:1810.04870v1 [cs.ds] 11 Oct 018 Aleksandar Ilić Facebook Inc, Menlo Park, California, USA e-mail: aleksandari@gmail.com Milan Bašić Faculty of Sciences and Mathematics,
More informationAn Introduction to Algebraic Graph Theory
An Introduction to Algebraic Graph Theory Rob Beezer beezer@ups.edu Department of Mathematics and Computer Science University of Puget Sound Mathematics Department Seminar Pacific University October 9,
More informationIndependent Transversal Equitable Domination in Graphs
International Mathematical Forum, Vol. 8, 2013, no. 15, 743-751 HIKARI Ltd, www.m-hikari.com Independent Transversal Equitable Domination in Graphs Dhananjaya Murthy B. V 1, G. Deepak 1 and N. D. Soner
More informationSIMPLICES AND SPECTRA OF GRAPHS
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 9, 000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 07 SIMPLICES AND SPECTRA OF GRAPHS
More informationOn energy, Laplacian energy and p-fold graphs
Electronic Journal of Graph Theory and Applications 3 (1) (2015), 94 107 On energy, Laplacian energy and p-fold graphs Hilal A. Ganie a, S. Pirzada b, Edy Tri Baskoro c a Department of Mathematics, University
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Mednykh A. D. (Sobolev Institute of Math) Laplacian for Graphs 27 June - 03 July 2015 1 / 30 Laplacians of Graphs, Spectra and Laplacian polynomials Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk
More informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationSpectra of the generalized edge corona of graphs
Discrete Mathematics, Algorithms and Applications Vol 0, No 08) 85000 0 pages) c World Scientific Publishing Company DOI: 04/S7938309850007 Spectra of the generalized edge corona of graphs Yanyan Luo and
More informationEvery SOMA(n 2, n) is Trojan
Every SOMA(n 2, n) is Trojan John Arhin 1 Marlboro College, PO Box A, 2582 South Road, Marlboro, Vermont, 05344, USA. Abstract A SOMA(k, n) is an n n array A each of whose entries is a k-subset of a knset
More informationSome Results on Super Mean Graphs
International J.Math. Combin. Vol.3 (009), 8-96 Some Results on Super Mean Graphs R. Vasuki 1 and A. Nagarajan 1 Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur - 68
More informationESSENTIAL SET AND ANTISYMMETRIC SETS OF CARTESIAN PRODUCT OF FUNCTION ALGEBRAS. 1. Introduction
Mathematics Today Vol.29(June-Dec-2013)25-30 ISSN 0976-3228 ESSENTIAL SET AND ANTISYMMETRIC SETS OF CARTESIAN PRODUCT OF FUNCTION ALGEBRAS H. S. MEHTA, R. D. MEHTA AND D. R. PATEL Abstract. Let A and B
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationv iv j E(G) x u, for each v V(G).
Volume 3, pp. 514-5, May 01 A NOTE ON THE LEAST EIGENVALUE OF A GRAPH WITH GIVEN MAXIMUM DEGREE BAO-XUAN ZHU Abstract. This note investigates the least eigenvalues of connected graphs with n vertices and
More informationOn the Laplacian Energy of Windmill Graph. and Graph D m,cn
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 9, 405-414 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2016.6844 On the Laplacian Energy of Windmill Graph
More informationNote on deleting a vertex and weak interlacing of the Laplacian spectrum
Electronic Journal of Linear Algebra Volume 16 Article 6 2007 Note on deleting a vertex and weak interlacing of the Laplacian spectrum Zvi Lotker zvilo@cse.bgu.ac.il Follow this and additional works at:
More informationOn spectral radius and energy of complete multipartite graphs
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn., ISSN 1855-3974 (electronic edn. ARS MATHEMATICA CONTEMPORANEA 9 (2015 109 113 On spectral radius and energy of complete multipartite
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationNormalized rational semiregular graphs
Electronic Journal of Linear Algebra Volume 8 Volume 8: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 6 015 Normalized rational semiregular graphs Randall
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationENERGY OF SOME CLUSTER GRAPHS
51 Kragujevac J. Sci. 23 (2001) 51-62. ENERGY OF SOME CLUSTER GRAPHS H. B. Walikar a and H. S. Ramane b a Karnatak University s Kittur Rani Chennama Post Graduate Centre, Department of Mathematics, Post
More informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationTHE GRAPHS WHOSE PERMANENTAL POLYNOMIALS ARE SYMMETRIC
Discussiones Mathematicae Graph Theory 38 (2018) 233 243 doi:10.7151/dmgt.1986 THE GRAPHS WHOSE PERMANENTAL POLYNOMIALS ARE SYMMETRIC Wei Li Department of Applied Mathematics, School of Science Northwestern
More informationDISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 155 164 doi:10.7151/dmgt.1902 DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS Ehsan Estaji Hakim Sabzevari University, Sabzevar, Iran e-mail: ehsan.estaji@hsu.ac.ir
More informationThe Distance Spectrum
The Distance Spectrum of a Tree Russell Merris DEPARTMENT OF MATHEMATICS AND COMPUTER SClENCE CALlFORNlA STATE UNlVERSlN HAYWARD, CAL lfornla ABSTRACT Let T be a tree with line graph T*. Define K = 21
More informationLaplacian Polynomial and Laplacian Energy of Some Cluster Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 5, May 2014, PP 448-452 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) wwwarcjournalsorg Laplacian Polynomial
More informationSTRONGLY REGULAR INTEGRAL CIRCULANT GRAPHS AND THEIR ENERGIES
BULLETIN OF INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 1840-4367 Vol. 2(2012), 9-16 Former BULLETIN OF SOCIETY OF MATHEMATICIANS BANJA LUKA ISSN 0354-5792 (o), ISSN 1986-521X (p) STRONGLY REGULAR
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 March 22, 2007 Outline 1 Introduction 2 The hierarchical
More informationEnergy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 21, no. 18, 895-9 Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph Zhongzhu Liu Department of Mathematics, South China Normal
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationBOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
Volume 115 No. 9 017, 343-351 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
More information1.10 Matrix Representation of Graphs
42 Basic Concepts of Graphs 1.10 Matrix Representation of Graphs Definitions: In this section, we introduce two kinds of matrix representations of a graph, that is, the adjacency matrix and incidence matrix
More informationSection 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices
3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices 1 Section 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices Note. In this section, we define the product
More informationMATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.
MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij
More informationLinear Algebra and its Applications
Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct
More informationProceedings of the 2014 Federated Conference on Computer Science and Information Systems pp
Proceedings of the 204 Federated Conference on Computer Science Information Systems pp. 479 486 DOI: 0.5439/204F297 ACSIS, Vol. 2 An efficient algorithm for the density Turán problem of some unicyclic
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More informationON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS
Kragujevac J. Sci. 29 2007) 73 84. UDC 541.66:547.318 ON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS Hanumappa B. Walikar, a Harishchandra S. Ramane, b Ivan Gutman, c Sabeena B. Halkarni a a Department of
More informationELA
THE DISTANCE MATRIX OF A BIDIRECTED TREE R. B. BAPAT, A. K. LAL, AND SUKANTA PATI Abstract. A bidirected tree is a tree in which each edge is replaced by two arcs in either direction. Formulas are obtained
More informationOn graphs with largest Laplacian eigenvalue at most 4
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 163 170 On graphs with largest Laplacian eigenvalue at most 4 G. R. Omidi Department of Mathematical Sciences Isfahan University of Technology
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationA lower bound for the spectral radius of graphs with fixed diameter
A lower bound for the spectral radius of graphs with fixed diameter Sebastian M. Cioabă Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA e-mail: cioaba@math.udel.edu Edwin
More informationTHE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3155 3161 S 0002-9939(9704049-5 THE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS TIMOTHY
More informationKevin James. MTHSC 3110 Section 2.1 Matrix Operations
MTHSC 3110 Section 2.1 Matrix Operations Notation Let A be an m n matrix, that is, m rows and n columns. We ll refer to the entries of A by their row and column indices. The entry in the i th row and j
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationCHARACTERISTIC POLYNOMIAL OF SOME CLUSTER GRAPHS
Kragujevac Journal of Mathematics Volume 37(2) (2013), Pages 369 373 CHARACTERISTIC POLYNOMIAL OF SOME CLUSTER GRAPHS PRABHAKAR R HAMPIHOLI 1 AND BASAVRAJ S DURGI 2 Abstract The characteristic polynomial
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationA Sharp Upper Bound on Algebraic Connectivity Using Domination Number
A Sharp Upper Bound on Algebraic Connectivity Using Domination Number M Aouchiche a, P Hansen a,b and D Stevanović c,d a GERAD and HEC Montreal, Montreal, Qc, CANADA b LIX, École Polytechnique, Palaiseau,
More informationON THE SINGULAR DECOMPOSITION OF MATRICES
An. Şt. Univ. Ovidius Constanţa Vol. 8, 00, 55 6 ON THE SINGULAR DECOMPOSITION OF MATRICES Alina PETRESCU-NIŢǍ Abstract This paper is an original presentation of the algorithm of the singular decomposition
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER OR RADIUS
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2010) 91-100 ISSN 0340-6253 ON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER
More informationIN1993, Klein and Randić [1] introduced a distance function
IAENG International Journal of Applied Mathematics 4:3 IJAM_4_3_0 Some esults of esistance Distance irchhoff Index Based on -Graph Qun Liu Abstract he resistance distance between any two vertices of a
More information