相关论文: Sombor indices of Silicon Carbide Graphs
Carbon nanotubes are a feverishly-studied topic in the scientific community as of late. Mathematically, they can be modeled with a quantum graph. Here we consider a structure somewhat similar to carbon nanotubes, another quantum graph that…
The sigma index of a graph, defined as the population variance of its degree sequence, is a fundamental measure of structural irregularity. In this paper, we introduce and systematically investigate its natural extension to fuzzy graphs,…
We study what kind of topological crystalline insulator phase emerges from nodal line semimetal phases in the face-centered cubic system which is not indicated by topological indices when spin-orbit coupling (SOC) is introduced. We…
Silicon carbide (SiC) is an excellent substrate for growth and manipulation of large scale, high quality epitaxial graphene. On the carbon face (the ($\bar{1}\bar{1}\bar{1}$) or $(000\bar{1}$) face, depending on the polytype), the onset of…
The automatic analysis of chemical literature has immense potential to accelerate the discovery of new materials and drugs. Much of the critical information in patent documents and scientific articles is contained in figures, depicting the…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive…
We investigate conditions on a graph $C^*$-algebra for the existence of a faithful semifinite trace. Using such a trace and the natural gauge action of the circle on the graph algebra, we construct a smooth $(1,\infty)$-summable semfinite…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
Index maps taking values in the $K$-theory of a mapping cone are defined and discussed. The resulting index theorem can be viewed in analogy with the Freed-Melrose index theorem. The framework of geometric $K$-homology is used in a…
We begin the study the algebraic topology of semi-coarse spaces, which are generalizations of coarse spaces that enable one to endow non-trivial `coarse-like' structures to compact metric spaces, something which is impossible in coarse…
We describe a general construction providing index theorems localizing the Chern classes of the normal bundle of a subvariety inside a complex manifold. As particular instances of our construction we recover both Lehmann-Suwa's…
The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…
A graph $G$ embedded in a surface $S$ is called an $S$-grid when every facial boundary walk has length four, that is, the topological dual graph of $G$ in $S$ is 4-regular. Aside from the case where $S$ is the torus or Klein bottle, an…
Graph operations are crucial for building complicated network architectures from simple graphs. In [7], authors defined two new variants of Corona product and investigated some topological indices. In this paper, we extended the work and…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…
mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs,…
To avoid extensive lab work on properties of chemical compounds, QSPR/QSAR analysis for topological descriptors is a productive statistical approach to analyze various physicochemical properties of chemical compounds. Many researchers have…