Laplacian integral graphs with a given degree sequence constraint

Let G be a graph on n vertices. The Laplacian matrix of G, denoted by L(G), is defined as L(G) = D(G) −A(G), where A(G) is the adjacency matrix of G and D(G) is the diagonal matrix of the vertex degrees of G. A graph G is said to be L-integral if all eigenvalues of the matrix L(G) are integers. In this paper, we characterize all Lintegral non-bipartite graphs among all connected graphs with at most two vertices of degree larger than or equal to three.

Comparing alternatives to the fixed degree sequence model for extracting the backbone of bipartite projections

Projections of bipartite or two-mode networks capture co-occurrences, and are used in diverse fields (e.g., ecology, economics, bibliometrics, politics) to represent unipartite networks. A key challenge in analyzing such networks is determining whether an observed number of co-occurrences between two nodes is significant, and therefore whether an edge exists between them. One approach, the fixed degree sequence model (FDSM), evaluates the significance of an edge’s weight by comparison to a null model in which the degree sequences of the original bipartite network are fixed. Although the FDSM is an intuitive null model, it is computationally expensive because it requires Monte Carlo simulation to estimate each edge’s p value, and therefore is impractical for large projections. In this paper, we explore four potential alternatives to FDSM: fixed fill model, fixed row model, fixed column model, and stochastic degree sequence model (SDSM). We compare these models to FDSM in terms of accuracy, speed, statistical power, similarity, and ability to recover known communities. We find that the computationally-fast SDSM offers a statistically conservative but close approximation of the computationally-impractical FDSM under a wide range of conditions, and that it correctly recovers a known community structure even when the signal is weak. Therefore, although each backbone model may have particular applications, we recommend SDSM for extracting the backbone of bipartite projections when FDSM is impractical.

The North–South Asymmetry of Sunspot Relative Numbers Based on Complex Network Technique

Solar magnetic activity exhibits a complex nonlinear behavior, but its dynamic process has not been fully understood. As the complex network technique can better capture the dynamics of nonlinear system, the visibility graphs (VG), the horizontal visibility graphs (HVG), and the limited penetrable visibility graphs (LPVG) are applied to implement the mapping of sunspot relative numbers in the northern and southern hemispheres. The results show that these three methods can capture important information of nonlinear dynamics existing in the long-term hemispheric sunspot activity. In the presentation of the results, the network degree sequence of the HVG method changes preferentially to the original data series as well as the VG and the LPVG, while both the VG and the LPVG slightly lag behind the original time series, which provides some new ideas for the nonlinear dynamics of the hemispheric asymmetry in the two hemispheres. Meanwhile, the use of statistical feature-skewness values and complex network visibility graphs can yield some complementary information for mutual verification.

Certain Bounds of Regularity of Elimination Ideals on Operations of Graphs

Elimination ideals are regarded as a special type of Borel type ideals, obtained from degree sequence of a graph, introduced by Anwar and Khalid. In this paper, we compute graphical degree stabilities of K n ∨ C m and K n ∗ C m by using the DVE method. We further compute sharp upper bound for Castelnuovo–Mumford regularity of elimination ideals associated to these families of graphs.

Energy of Nonsingular Graphs: Improving Lower Bounds

Let G be a simple graph of order n and A be its adjacency matrix. Let λ 1 ≥ λ 2 ≥ … ≥ λ n be eigenvalues of matrix A . Then, the energy of a graph G is defined as ε G = ∑ i = 1 n λ i . In this paper, we will discuss the new lower bounds for the energy of nonsingular graphs in terms of degree sequence, 2-sequence, the first Zagreb index, and chromatic number. Moreover, we improve some previous well-known bounds for connected nonsingular graphs.