scholarly journals There are integral trees of diameter 7

Author(s):  
Pavel Híc ◽  
Milan Pokorný

A graph G is called integral if all the roots of the characteristic polynomial P(G; x) are integers. In this paper, four integral trees of diameter 7 are given. These integral trees are the first integral trees of diameter 7 which have been found so far.

2020 ◽  
Vol 75 (12) ◽  
pp. 999-1007
Author(s):  
Rustam Ali ◽  
Anjali Sharma ◽  
Prasanta Chatterjee

AbstractHead-on interaction of four dust ion acoustic (DIA) solitons and the statistical properties of the wave field due to head-on interaction of solitons moving in opposite direction is studied in the framework of two Korteweg de Vries (KdV) equations. The extended Poincaré–Lighthill–Kuo (PLK) method is applied to obtain two opposite moving KdV equations from an unmagnetized four component plasma model consisting of Maxwellian negative ions, cold mobile positive ions, κ-distributed electrons and positively charged dust grains. Hirota’s bilinear method is adopted to obtain two-soliton solutions of both the KdV equations and accordingly act of soliton turbulence is presented due to head-on collision of four solitons. The amplitude and shape of the resultant wave profile at the point of strongest interaction are obtained. To see the effect of head-on collision on the statistical properties of wave field the first four moments are computed. It is observed that the head-on collision has no effect on the first integral moment while the second, third and fourth moments increase in the dominant interaction region of four solitons, which is a clean indication of soliton turbulence.


2021 ◽  
Vol 9 (1) ◽  
pp. 1-18
Author(s):  
Carolyn Reinhart

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.


2020 ◽  
Vol 2020 (9) ◽  
Author(s):  
Jorge G. Russo ◽  
Miguel Tierz

Abstract We study a unitary matrix model of the Gross-Witten-Wadia type, extended with the addition of characteristic polynomial insertions. The model interpolates between solvable unitary matrix models and is the unitary counterpart of a deformed Cauchy ensemble. Exact formulas for the partition function and Wilson loops are given in terms of Toeplitz determinants and minors and large N results are obtained by using Szegö theorem with a Fisher-Hartwig singularity. In the large N (planar) limit with two scaled couplings, the theory exhibits a surprisingly intricate phase structure in the two-dimensional parameter space.


Sign in / Sign up

Export Citation Format

Share Document