Results 31 to 40 of about 207,710 (268)
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +1 more source
Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
Mathematics, 2021 An automorphism of a graph is a mapping of the vertices onto themselves such that connections between respective edges are preserved. A vertex v in a graph G is fixed if it is mapped to itself under every automorphism of G. The fixing number of a graph G
Josephine Brooks +5 more
doaj +1 more source
Transitive Triangle Tilings in Oriented Graphs [PDF]
, 2017 In this paper, we prove an analogue of Corr\'adi and Hajnal's classical theorem. There exists $n_0$ such that for every $n \in 3\mathbb{Z}$ when $n \ge n_0$ the following holds.
Balogh, József +2 more
core +2 more sources
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 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
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
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
Square Property, Equitable Partitions, and Product-like Graphs [PDF]
, 2013 Equivalence relations on the edge set of a graph $G$ that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles.
Hellmuth, Marc +2 more
core +1 more source
Search for the end of a path in the d-dimensional grid and in other graphs [PDF]
, 2015 We consider the worst-case query complexity of some variants of certain \cl{PPAD}-complete search problems. Suppose we are given a graph $G$ and a vertex $s \in V(G)$.
Gerbner, Dániel +4 more
core +2 more sources
From Time–Frequency to Vertex–Frequency and Back
Mathematics, 2021 The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković +5 more
doaj +1 more source