Results 21 to 30 of about 885,664 (282)

Computing Edge Version of Resolvability and Double Resolvability of a Graph

open access: yesJournal of Chemistry, 2022
The field of graph theory is extensively used to investigate structure models in biology, computer programming, chemistry, and combinatorial optimization. In order to work with the chemical structure, chemists require a mathematical form of the compound.
Muhammad Ahmad   +3 more
doaj   +1 more source

Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid

open access: yesMathematics, 2021
Geometric arrangements of hexagons into six sides of benzenoids are known as coronoid systems. They are organic chemical structures by definition. Hollow coronoids are divided into two types: primitive and catacondensed coronoids.
Ali N. A. Koam   +3 more
doaj   +1 more source

Performance analysis of control allocation using data‐driven integral quadratic constraints

open access: yesAdvanced Control for Applications, Volume 4, Issue 4, December 2022., 2022
Abstract A new method is presented for evaluating the performance of a nonlinear control allocation system within a linear control loop. To that end, a worst‐case gain analysis problem is formulated that can be readily solved by means of well‐established methods from robustness analysis using integral quadratic constraints (IQCs).
Manuel Pusch   +2 more
wiley   +1 more source

Scrambling in Yang-Mills

open access: yesJournal of High Energy Physics, 2021
Acting on operators with a bare dimension ∆ ∼ N 2 the dilatation operator of U(N) N $$ \mathcal{N} $$ = 4 super Yang-Mills theory defines a 2-local Hamiltonian acting on a graph.
Robert de Mello Koch   +2 more
doaj   +1 more source

A central local metric dimension on acyclic and grid graph

open access: yesAIMS Mathematics, 2023
The local metric dimension is one of many topics in graph theory with several applications. One of its applications is a new model for assigning codes to customers in delivery services. Let $ G $ be a connected graph and $ V(G) $ be a vertex set of $ G $.
Yuni Listiana   +3 more
doaj   +1 more source

Metric and Fault-Tolerant Metric Dimension of Hollow Coronoid

open access: yesIEEE Access, 2021
Coronoid systems actually arrangements of hexagons into six sides of benzenoids. By nature, it is an organic chemical structure. Hollow coronoids are primitive and catacondensed coronoids. It is also known as polycyclic conjugated hydrocarbons.
Ali N. A. Koam   +3 more
doaj   +1 more source

The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs

open access: yesApplied Sciences, 2022
The concept of metric-related parameters permeates all of graph theory and plays an important role in diverse networks, such as social networks, computer networks, biological networks and neural networks.
Kamran Azhar   +4 more
doaj   +1 more source

A new upper bound for the Asymptotic Dimension of RACGs [PDF]

open access: yesCan. Math. Bull. 67 (2024) 338-349, 2021
Let $W_\Gamma$ be the Right-Angled Coxeter group with defining graph $\Gamma$. We show that the asymptotic dimension of $W_\Gamma$ is smaller than or equal to $dim_{CC}(\Gamma)$, the clique-connected dimension of the graph. As a corollary we show that $W_\Gamma$ is virtually free if and only if $dim_{CC}(\Gamma)=1$.
arxiv   +1 more source

A Central Local Metric Dimension of Generalized Fan Graph, Generalized Broken Fan Graph, and Cm ⊙ K¯m [PDF]

open access: yesE3S Web of Conferences
The central local metric dimension is a new variation of local metric dimension that introduced in 2023. The central local metric dimension is a new concept that enriches research studies in graph theory, especially in the field of metric dimension. This
Listiana Yuni, Susilowati Liliek, Slamin
doaj   +1 more source

On the WL-dimension of circulant graphs of prime power order [PDF]

open access: yesarXiv, 2022
The WL-dimension of a graph X is the smallest positive integer m such that the m-dimensional Weisfeiler-Leman algorithm correctly tests the isomorphism between X and any other graph. It is proved that the WL-dimension of any circulant graph of prime power order is at most 3, and this bound cannot be reduced.
arxiv  

Home - About - Disclaimer - Privacy