Degree sum energyTotal transformation graphsThe energy E(G) of a graph G is the sum of absolute values of the eigenvalues of the adjacency matrix of G. This definition of energy was motivated by the large number of results for the Huckel molecular orbital total 蟺-electron energy. Motivated ...
This work initiates a concept of reduced reverse degree based[Math Processing Error]-Polynomial for a graph, and differential and integral operators by using this[Math Processing Error]-Polynomial. In this study twelve reduced reverse degree-based topological descriptors are formulated using the[Math P...
Graphene derivatives, such as graphyne and graphdiyne, have received a lot of attention in mathematics and science because of their outstanding optical, electrical, and mechanical capabilities. These materials have various mathematical applications, including Graphyne and graphdiyne are combinatorial graphs in...
If we consider the contact process with infection rate \lambda \lambda on a random graph on n n vertices with power law degree distributions, mean field calculations suggest that the critical value \lambda_c \lambda_c of the infection rate is positive if the power \alpha>3 \alpha>3 . Phy...
The distribution of avalanche sizes at criticality is known to depend non-trivially on the degree distribution of the underlying network24, but the time dependence of cascades has not been studied from this perspective. In this paper, we focus on the temporal profile of cascades, i.e., the ...
Together, this suggests that the setup with foot-mounted inertial sensors and inter-agent ranging as illustrated in Figure1 is suitably used as a base setup for any infrastructure-free pedestrian localization system. However, despite the mature components and the in principle straight-forward ...
In just a few years, the issue of “digital sovereignty” has emerged as an important security issue for governments across the globe, reflecting a growing unease about the security risks associated with government services that depend on foreign service providers for digital infrastructure and traffic...
However, in m-polar fuzzy graphs (mPFG), each node as well as edges has m components. So, defining integrity in the mPF environment needs a new concept. As in the m-polar fuzzy environment, each node and edge has m components, so we have more flexibility to address the uncertainty ...
The subgraph-matching problem in multi-graphs is relatively new. Ingalalli et al. [18] presented SuMGra, a feature-based indexing method that supports subgraph matching in a multi-graph. SuMGra mapped nodes to a six-features vector such that one of them is a structural feature and the rema...
Later on we will see that in a more gen- eral context one has to drop this assumption and consider manifolds that are not connected. A spacetime M is said to be orientable if there exists a differential form of maximal degree (a volume form), which does not vanish anywhere. We say ...