Results 31 to 40 of about 923,481 (280)
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
IEEE Access, 2021 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
A Comparative Study of Three Resolving Parameters of Graphs
Complexity, 2021 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
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces [PDF]
Journal of the European Mathematical Society (Print), 2020 The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric and show their ...
Marthe Bonamy +6 more
semanticscholar +1 more source
The partition dimension of a subdivision of a homogeneous firecracker
Electronic Journal of Graph Theory and Applications, 2020 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
Computing the Metric Dimension of a Graph from Primary Subgraphs [PDF]
Discussiones Mathematicae Graph Theory, 2013 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
Topological Graph Polynomials in Colored Group Field Theory [PDF]
, 2009 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
Graph weights arising from Mayer and Ree-Hoover theories of virial expansions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 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
Dimension and cut vertices: an application of Ramsey theory [PDF]
arXiv.org, 2015 Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$ is at most $d$
W. T. Trotter +2 more
semanticscholar +1 more source
Topological minors of cover graphs and dimension [PDF]
, 2016 We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak.
Dujmović +16 more
core +1 more source
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2012 Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form f(G * H) where G and H are graphs, * is a graph product and f is a graph property.
Parinya Chalermsook +2 more
semanticscholar +1 more source