Results 31 to 40 of about 1,053,119 (296)
The d=6 trace anomaly from quantum field theory four-loop graphs in one dimension [PDF]
23 pages, 17 ...
Hatzinikitas, A., Portugal, R.
openaire +4 more sources
Topological Graph Polynomials in Colored Group Field Theory [PDF]
In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex.
A. Connes +37 more
core +1 more source
The partition dimension of a subdivision of a homogeneous firecracker
Finding the partition dimension of a graph is one of the interesting (and uncompletely solved) problems of graph theory. For instance, the values of the partition dimensions for most kind of trees are still unknown. Although for several classes of trees
Amrullah Amrullah
doaj +1 more source
A Comparative Study of Three Resolving Parameters of Graphs
Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures,
Hafiz Muhammad Ikhlaq +2 more
doaj +1 more source
Graph weights arising from Mayer and Ree-Hoover theories of virial expansions [PDF]
We study graph weights (i.e., graph invariants) which arise naturally in Mayer's theory and Ree-Hoover's theory of virial expansions in the context of a non-ideal gas.
Amel Kaouche, Pierre Leroux
doaj +1 more source
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
The production of low-cost, small in size, and high in efficiency objects is the topic of research in almost all scientific fields, especially of engineering. In this scenario, nanotechnology becomes of great importance. To achieve these tasks, one needs
Ayesha Shabbir, Muhammad Azeem
semanticscholar +1 more source
Computing the Metric Dimension of a Graph from Primary Subgraphs [PDF]
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . .
D. Kuziak +2 more
semanticscholar +1 more source
Simplicial and Cellular Trees [PDF]
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension.
Duval, Art M. +2 more
core +2 more sources
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties [PDF]
The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a fruitful approach to the Graph Isomorphism problem. 2-WL corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago.
V. Arvind +3 more
semanticscholar +1 more source
Metric Dimension of Line Graphs of Bakelite and Subdivided Bakelite Network
Graph theory is considered one of the major subjects, and it also plays a significant role in the digital world. It has numerous uses in computer science, robot navigation, and chemistry.
Muhammad Umer Farooq +5 more
doaj +1 more source

