Results 11 to 20 of about 507,335 (290)

A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus (Track B: Automata, Logic, Semantics, and Theory of Programming)

open access: green, 2019
The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension can also be characterised in terms of the number of variables that is required to describe the graph up to ...
Martin Grohe, Sandra Kiefer
openalex   +4 more sources

Exploring metric dimension of nanosheets, nanotubes, and nanotori of SiO2. [PDF]

open access: yesPLoS ONE
This work investigates the metric dimension (MD) and edge metric dimension (EMD) of SiO2 nanostructures, specifically nanosheets, nanotubes, and nanotorii.
Umar Farooq   +4 more
doaj   +2 more sources

Multi-Criteria Decision Making and Graph Theory-Based Optimization of the Lahore Metro System: A Metric Dimension, VIKOR, and PROMETHEE Approach

open access: diamondJournal of Mathematics Research
Urban transportation networks play a crucial role in modern city planning, requiring efficient design, optimization, and management strategies. This study examines the Lahore Metro Orange Line using a combination of graph theory and multi-criteria decision-making (MCDM) techniques, specifically the metric dimension analysis, VIKOR, and PROMETHEE ...
Umar Farooq   +2 more
openalex   +3 more sources

Computation of mixed resolvability for a circular ladder and its unbounded nature. [PDF]

open access: yesPLoS ONE
Let Γ = Γ(V ,E) be a simple, planar, connected, and undirected graph. The article primarily concentrates on a category of planar graphs, detailing the explicit identification of each member within this graph family. Within the domain of graph theory, the
Sunny Kumar Sharma   +4 more
doaj   +2 more sources

Limit theory of sparse random geometric graphs in high dimensions [PDF]

open access: yesStochastic Processes and their Applications, 2023
We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we establish moment asymptotics, functional central limit theorems and Poisson approximation theorems for certain functionals
Gilles Bonnet   +3 more
openaire   +2 more sources

The Dominant Metric Dimension of Corona Product Graphs

open access: yesمجلة بغداد للعلوم, 2021
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations.
Rembulan Putri Adirasari   +2 more
doaj   +1 more source

On the VC-dimension‎, ‎covering and separating properties of the cycle and spanning tree hypergraphs of graphs [PDF]

open access: yesTransactions on Combinatorics, 2022
In this paper‎, ‎we delve into studying some relations between the structure of the cycles and spanning trees of a graph through the lens of its cycle and spanning tree hypergraphs which are hypergraphs with the edge set of the graph as their vertices ...
Alireza Mofidi
doaj   +1 more source

Patched Network and Its Vertex-Edge Metric-Based Dimension

open access: yesIEEE Access, 2023
The p-type networks are designed with the help of CVNET at topo group Cluj and also given support by nano studio. Such networks develop new p-type surfaces and also represent the decorations of the surfaces.
Sidra Bukhari   +3 more
doaj   +1 more source

Fault-Tolerant Partition Resolvability of Cyclic Networks

open access: yesJournal of Mathematics, 2021
Graph invariants provide an amazing tool to analyze the abstract structures of networks. The interaction and interconnection between devices, sensors, and service providers have opened the door for an eruption of mobile over the web applications ...
Kamran Azhar   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy