On normalized Laplacian, degree-Kirchhoff index of the strong prism of the dicyclobutadieno derivative of linear phenylenes

Phenylenes network is applied in several fields of chemistry sciences due to its advantages compared to other several columnar networks, recently. This paper aims to introduce a kind of networks which obtained by a family of dicyclobutadieno derivative of linear phenylene chain Ln which is made up of n hexagons and (n+1) quadrangles. Let L2n be the strong prism of the dicyclobutadieno derivative of linear phenylenes Ln. By taking full advantage of the knowleges about the normalized Laplacian spectra, we induce the explicit expressions, with respect to the index n, of the multiplicative degree-Kirchhoff index and the number of spanning tree based on the graph L2n.

Geometry and symmetry in biochemical reaction systems

Complex systems of intracellular biochemical reactions have a central role in regulating cell identities and functions. Biochemical reaction systems are typically studied using the language and tools of graph theory. However, graph representations only describe pairwise interactions between molecular species and so are not well suited to modelling complex sets of reactions that may involve numerous reactants and/or products. Here, we make use of a recently developed hypergraph theory of chemical reactions that naturally allows for higher-order interactions to explore the geometry and quantify functional redundancy in biochemical reactions systems. Our results constitute a general theory of automorphisms for oriented hypergraphs and describe the effect of automorphism group structure on hypergraph Laplacian spectra.

On Consensus Index of Triplex Star-Like Networks: A Graph Spectra Approach

In this article, the consensus-related performances of the triplex multi-agent systems with star-related structures, which can be measured by the algebraic connectivity and network coherence, have been studied by the characterization of Laplacian spectra. Some notions of graph operations are introduced to construct several triplex networks with star substructures. The methods of graph spectra are applied to derive the network coherence, and some asymptotic behaviors of the indices have been derived. It is found that the operations of adhering star topologies will make the first-order coherence increase a constant value under the triplex structures as parameters tend to infinity, and the second-order coherence have some equality relations as the node related parameters tend to infinity. Finally, the consensus related indices of the triplex systems with the same number of nodes but non-isomorphic graph structures have been compared and simulated to verify the results.

Distance Laplacian spectra of joined union of graphs

The distance Laplacian matrix of a simple connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix whose main diagonal entries are the vertex transmissions in [Formula: see text] In this paper, we determine the distance Laplacian spectra of the graphs obtained by generalization of the join and lexicographic product of graphs (namely joined union). It is shown that the distance Laplacian spectra of these graphs not only depend on the distance Laplacian spectra of the participating graphs but also depend on the spectrum of another matrix of vertex-weighted Laplacian kind (analogous to the definition given by Chung and Langlands [A combinatorial Laplacian with vertex weights, J. Combin. Theory Ser. A 75 (1996) 316–327]).

On the spectra of a new duplication based corona of graphs

In this paper we introduce a new corona-type product of graphs namely duplication corresponding corona. Here we mainly determine the adjacency, Laplacian and signless Laplacian spectra of the new graph product. In addition to that, we find out the incidence energy, the number of spanning trees, Kirchhoff index and Laplacian-energy-like invariant of the new graph. Also we discuss some new classes of cospectral graphs.