Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph

Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider only the strongly connected component whose adjacency submatrix has the largest eigenvalue. In this paper, for each and every strongly connected component in a digraph, we add weights to diagonal elements of its member nodes in the adjacency matrix such that the modified matrix will have the new unique largest eigenvalue and corresponding principal eigenvectors. Consequently, we use the new principal eigenvectors of the modified matrices, based on different strongly connected components, not only to compose centrality measures but also to identify bowtie structures for a digraph.     

Highly Proton-Conductive Zinc Metal-Organic Framework Based On Nickel(II) Porphyrinylphosphonate

The design of new solid-state proton-conducting materials is a great challenge for chemistry and materials science. Herein, a new anionic porphyrinylphosphonate-based MOF ( IPCE-1Ni ), which involves dimethylammonium (DMA) cations for charge compensation, is reported. As a result of its unique structure, IPCE-1Ni exhibits one of the highest value of the proton conductivity among reported proton-conducting MOF materials based on porphyrins (1.55×10⁻³ S cm⁻¹ at 75 °C and 80 % relative humidity).     

Invertibility of Multidimensional Integral Operators with Bihomogeneous Kernels

Mathematical Notes -     

Synthesis and luminescence properties of hybrid systems based on liquid crystal terbium(ІІІ) and europium(ІІІ) complexes

Russian Journal of General Chemistry - Hybrid liquid crystal systems with different ratios of the components have been prepared on the basis of 5,5′-di(heptadecyl)-2,2′-bipyridine...     

Unfamiliar Aspects of Bäcklund Transformations and an Associated Degasperis–Procesi Equation

We summarize the results of our recent work on Bäcklund transformations (BTs), particularly focusing on the relation between BTs and infinitesimal symmetries. We present a BT for an associated Degasperis–Procesi (aDP) equation and its superposition principle and investigate the solutions generated by applying this BT. Following our general methodology, we use the superposition principle of the BT to generate the infinitesimal symmetries of the aDP equation.     

Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.