Results 31 to 40 of about 357,448 (292)
The Morita Theory of Quantum Graph Isomorphisms [PDF]
Communications in Mathematical Physics, 2018 We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism groups. Specifically, we show that graphs quantum isomorphic
Benjamin Musto +2 more
semanticscholar +1 more source
Computation of Resolvability Parameters for Benzenoid Hammer Graph
Journal of Mathematics, 2022 A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
On Divided-Type Connectivity of Graphs
Entropy, 2023 The graph connectivity is a fundamental concept in graph theory. In particular, it plays a vital role in applications related to the modern interconnection graphs, e.g., it can be used to measure the vulnerability of the corresponding graph, and is an ...
Qiao Zhou, Xiaomin Wang, Bing Yao
doaj +1 more source
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability [PDF]
, 2016 In this paper we consider pushdown graphs, i.e. infinite graphs that can be described as transition graphs of deterministic real-time pushdown automata.
Carayol, Arnaud, Serre, Olivier
core +5 more sources
The Ramsey theory of the universal homogeneous triangle-free graph [PDF]
Journal of Mathematical Logic, 2017 The universal homogeneous triangle-free graph, constructed by Henson [A family of countable homogeneous graphs, Pacific J. Math. 38(1) (1971) 69–83] and denoted [Formula: see text], is the triangle-free analogue of the Rado graph. While the Ramsey theory
Natasha Dobrinen
semanticscholar +1 more source
A paradigmatic approach to investigate restricted hyper totient graphs
AIMS Mathematics, 2021 Nowadays, the problem of finding families of graphs for which one may ensure the existence of a vertex-labeling and/or an edge-labeling based on a certain class of integers, constitutes a challenge for researchers in both number and graph theory. In this
Shahbaz Ali +2 more
doaj +1 more source
On Degree-Based Topological Indices of Petersen Subdivision Graph
European Journal of Mathematical Analysis, 2023 In this paper, we adequately describe the generalised petersen graph, expanding to the categories of graphs. We created a petersen graph, which is cyclic and has vertices that are arranged in the centre and nine gons plus one vertex, leading to the ...
Mukhtar Ahmad +5 more
doaj +1 more source
On vertex and edge degree-based topological indices
Vojnotehnički Glasnik, 2023 Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj +1 more source
Fundamental Study of the Fill-in Minimization Problem [PDF]
, 1980 In this paper the fill-in minimization problem which arises at the application of the sparse matrix method for a large sparse set of linear equations is discussed from the graph-theoretic viewpoint and also through the numerical experiments.
Numata, Katsu, Taniguchi, Takeo
core +1 more source
Connectivity Analysis of Cyclically Balanced Fuzzy Graphs
Fuzzy Information and Engineering, 2015 The concepts of connectivity and cycle connectivity play an important role in fuzzy graph theory. In this article, cyclic cutvertices, cyclic bridges and cyclically balanced fuzzy graphs are discussed.
N. Jicy, Sunil Mathew
doaj +1 more source