Figure 1 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
Example Erdos-Renyi random graph with 25 nodes and 50 edges. Left: Graphical representation. Right: Corresponding precision matrix Ψ.
Source publication
Building models and methods for complex data is an important task for many scientific and application areas. Many modern datasets exhibit dependencies among observations as well as variables. This gives rise to the challenging problem of analyzing high-dimensional matrix-variate data with unknown dependence structures. To address this challenge, Ka...
Similar publications
The area of graph theory (GT) is rapidly expanding and playing a significant role in cheminformatics, mostly in mathematics and chemistry to develop different physicochemical, chemical structure, and their properties. The manipulation and study of chemical graphical details are made feasible by using numerical structure invariant. Investigating the...
Let $G$ be a connected graph with $n$ vertices and $m$ edges. The vertex-degree-based topological index (VDB) (or graphical function-index) $TI(G)$ of $G$ with edge-weight function $I(x,y)$ is defined as $$TI(G)=\sum\limits_{uv\in E(G)}I(d_{u},d_{v}),$$ where $I(x,y)>0$ is a symmetric real function with $x\geq 1$ and $y\geq 1$, $d_{u}$ is the degre...
![The non-equivalent colorings of P4\documentclass[12pt]{minimal}...](publication/370049472/figure/fig1/AS:11431281162473639@1685324912074/The-non-equivalent-colorings-of-P4documentclass12ptminimal-usepackageamsmath_Q320.jpg)
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let A(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackag...
