Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The normalized Laplacians, degree-Kirchhoff index, and the complexity of Möbius graph of linear octagonal-quadrilateral networks - MaRDI portal

The normalized Laplacians, degree-Kirchhoff index, and the complexity of Möbius graph of linear octagonal-quadrilateral networks (Q2051615)

From MaRDI portal





scientific article; zbMATH DE number 7433054
Language Label Description Also known as
English
The normalized Laplacians, degree-Kirchhoff index, and the complexity of Möbius graph of linear octagonal-quadrilateral networks
scientific article; zbMATH DE number 7433054

    Statements

    The normalized Laplacians, degree-Kirchhoff index, and the complexity of Möbius graph of linear octagonal-quadrilateral networks (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2021
    0 references
    Summary: The normalized Laplacian plays an indispensable role in exploring the structural properties of irregular graphs. Let \(L_n^{8, 4}\) represent a linear octagonal-quadrilateral network. Then, by identifying the opposite lateral edges of \(L_n^{8, 4}\), we get the corresponding Möbius graph \(MQ_n(8, 4)\). In this paper, starting from the decomposition theorem of polynomials, we infer that the normalized Laplacian spectrum of \(MQ_n(8, 4)\) can be determined by the eigenvalues of two symmetric quasi-triangular matrices \(\mathscr{L}_A\) and \(\mathscr{L}_S\) of order \(4n\). Next, owing to the relationship between the two matrix roots and the coefficients mentioned above, we derive the explicit expressions of the degree-Kirchhoff indices and the complexity of \(MQ_n(8, 4)\).
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references