Related papers: Adjacency Energy of Hypergraphs
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…
For a given simple graph $G$, the energy of $G$, denoted by $\mathcal {E}(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was defined by I. Gutman. The problem on determining the maximal…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
We study the notion of heterotopic energy defined as the limit of Sobolev energies of Sobolev mappings in a given homotopy class approximating almost everywhere a given Sobolev mapping. We show that the heterotopic energy is finite if and…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…
We consider vertex coloring of an acyclic digraph $\Gdag$ in such a way that two vertices which have a common ancestor in $\Gdag$ receive distinct colors. Such colorings arise in a natural way when bounding space for various genetic data…
For a given simple graph $G$, the energy of $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $P_n^{\ell}$ be the unicyclic graph obtained by connecting a vertex of $C_\ell$…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
The power graph $\mathscr{P}(G)$ of a group $G$ is an undirected graph with all the elements of $G$ as vertices and where any two vertices $u$ and $v$ are adjacent if and only if $u=v^m $ or $v=u^m$, $ m \in$ $\mathbb{Z}$. For a simple…
The extremal characteristics of random structures, including trees, graphs, and networks, are discussed. A statistical physics approach is employed in which extremal properties are obtained through suitably defined rate equations. A variety…
The energy losses and spectra of Ultra High Energy Cosmic Rays (UHECR) are calculated for protons as primary particles. The attention is given to the energy losses due to electron-positron production in collisions with the microwave 2.73 K…
The capacity of a graph is defined as the rate of exponential growth of independent sets in the strong powers of the graph. In the strong power an edge connects two sequences if at each position their letters are equal or adjacent. We…
We analyze the allowed energy levels of Hawking radiation from Schwarzschild surfaces in space-times with large extra dimensions. From the requirement that the wave functions associated with these particles be single-valued and obey radial…
In this paper, we investigate the structural properties of trees and bipartite graphs through the lens of topological indices and combinatorial graph theory. We focus on the First and Second Hyper-Zagreb indices, $HM_1(G)$ and $HM_2(G)$,…
The energy of a graph was introduced by {\sc Gutman} in 1978 as the sum of the absolute values of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized…
The thermodynamical properties of dark energy are usually investigated with the equation of state $\omega =\omega_{0}+\omega_{1}z$. Recent observations show that our universe is accelerating, and the apparent horizon and the event horizon…
Let $M$ be a mixed graph and $H(M)$ be its Hermitian-adjacency matrix. If we add every edge and arc in $M$ a Randi\'c weight, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix? Motivated…
Technological civilizations may rely upon large-scale photovoltaic arrays to harness energy from their host star. Photovoltaic materials, such as silicon, possess distinctive spectral features, including an "artificial edge" that is…
Let $G$ be a simple graph of order $n$. The energy $E(G)$ of the graph $G$ is the sum of the absolute values of the eigenvalues of $G$. The Randi\'{c} matrix of $G$, denoted by $R(G)$, is defined as the $n\times n$ matrix whose…
The energy $E(G)$ of a graph $G$ is defined as the sum of the absolute values of the eigenvalues of $G$. An $n$-vertex graph is said to be hypoenergetic if $E(G)<n$ and strongly hypoenergetic if $E(G)<n-1$. In this paper, we consider…