Results 11 to 20 of about 2,530 (150)
The scattering matrix with respect to an Hermitian matrix of a graph [PDF]
Discrete Mathematics, 2021 Recently, Gnutzmann and Smilansky [5] presented a formula for the bond scattering matrix of a graph with respect to a Hermitian matrix. We present another proof for this Gnutzmann and Smilansky’s formula by a technique used in the zeta function of a ...
T. Komatsu, N. Konno, I. Sato
semanticscholar +1 more source
Counterexamples of the Bhattacharya-Friedland-Peled conjecture [PDF]
Linear Algebra and its Applications, 2021 The Brauldi-Hoffman conjecture, proved by Rowlinson in 1988, characterized the graph with maximal spectral radius among all simple graphs with prescribed number of edges.
Yen-Jen Cheng +2 more
semanticscholar +1 more source
On the Randić energy of caterpillar graphs [PDF]
Match-communications in Mathematical and in Computer Chemistry, 2021 A caterpillar graph T (p1, . . . , pr) of order n = r + ∑r i=1 pi, r ≥ 2, is a tree such that removing all its pendent vertices gives rise to a path of order r.
D. Cardoso +3 more
semanticscholar +1 more source
Signless normalized Laplacian for hypergraphs [PDF]
Electronic Journal of Graph Theory and Applications, 2020 The spectral theory of the normalized Laplacian for chemical hypergraphs is further inves-tigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
E. Andreotti, R. Mulas
semanticscholar +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Majalah Ilmiah Matematika dan Statistika, 2022 Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
semanticscholar +1 more source
Inverse Sum Status Energy of a Graph
International Journal for Research in Applied Science and Engineering Technology, 2021 Motivated by the inverse sum status index, we introduce the inverse sum status matrix ISS={■((σ_u σ_v)/((σ_u+σ_v ) ) if u_i~v_j,@0 otherwise)┤ Thus we also obtained the results for well known graphs. Keywords: Inverse sum status energy, Inverse Sum Indeg
K. N. Prakasha
semanticscholar +1 more source
Electronic Journal of Graph Theory and Applications, 2021 The d-Fibonacci digraphs F (d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs.
C. Dalfó, M. A. Fiol
semanticscholar +1 more source
Bounds on graph eigenvalues II [PDF]
, 2006 We prove three results about the spectral radius μ(G) of a graph G: (a) Let Tr (n) be the r-partite Turán graph of order n. If G is a Kr+1-free graph of order n, then μ(G) < μ(Tr (n)) unless G = Tr (n). (b) For most irregular graphs G of order n and size
V. Nikiforov
semanticscholar +1 more source
Graph complement conjecture for classes of shadow graphs
Operators and Matrices, 2021 The real minimum semidefinite rank of a graph G , denoted mrR+(G) , is defined to be the minimum rank among all real symmetric positive semidefinite matrices whose zero/nonzero pattern corresponds to the graph G .
Monsikarn Jansrang, S. Narayan
semanticscholar +1 more source
Cospectral digraphs from locally line digraphs [PDF]
, 2016 A digraph Γ = (V,E) is a line digraph when every pair of vertices u, v ∈ V have either equal or disjoint in-neighborhoods. When this condition only applies for vertices in a given subset (with at least two elements), we say that Γ is a locally line ...
C. Dalfó, M. A. Fiol
semanticscholar +1 more source