Results 11 to 20 of about 8,467 (244)
Vertex maps on graphs -- Perron-Frobenius Theory [PDF]
Journal of Difference Equations and Applications, 2015 The goal of this paper is to describe the connections between Perron-Frobenius theory and vertex maps on graphs. In particular, it is shown how Perron-Frobenius theory gives results about the sets of integers that can arise as periods of periodic orbits, about the concepts of transitivity and topological mixing, and about horseshoes and topological ...
Chris Bernhardt
+6 more sources
Online Graph Topology Learning via Time-Vertex Adaptive Filters: From Theory to Cardiac Fibrillation [PDF]
IEEE Transactions on Signal and Information Processing over NetworksGraph Signal Processing (GSP) provides a powerful framework for analysing complex, interconnected systems by modelling data as signals on graphs. While recent advances have enabled graph topology learning from observed signals, existing methods often struggle with time-varying systems and real-time applications. To address this gap, we introduce AdaCGP,
Alexander Jenkins +4 more
+5 more sources
Iwasawa theory for vertex-weighted graphs [PDF]
29 pages, 8 ...
Ryosuke Murooka, Sohei Tateno
openalex +3 more sources
An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory
, 2018 The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications.
Yongfei Zhang +5 more
openalex +3 more sources
Sampling theory of jointly bandlimited time-vertex graph signals [PDF]
Signal Processing, 2023 Time-vertex graph signal (TVGS) models describe time-varying data with irregular structures. The bandlimitedness in the joint time-vertex Fourier spectral domain reflects smoothness in both temporal and graph topology. In this paper, we study the critical sampling of three types of TVGS including continuous-time signals, infinite-length sequences, and ...
Hang Sheng +4 more
openalex +3 more sources
Relation algebras and vertex conditions in graph theory
, 1998 The scheme associated with a graph is an association scheme iff the graph is strongly regular. Consider the problem of extending such an association scheme to a superscheme. The obstacles can be expressed in terms of f-vertex conditions. If a graph does not satisfy the i-vertex condition, a presuperscheme associated with it cannot be erected beyond the
Jerzy Wojdyło
openalex +4 more sources
Advancing Graph Theory with Genetic Algorithms: AFocus on Non-Inclusive Vertex Irregular Labeling
European Journal of Pure and Applied MathematicsNon-inclusive irregular vertex labeling is a labeling on a graph where the vertex labels are real numbers with weights. The weight is defined as the sum of the labels of the connected nodes. The main problem in labeling graphs is finding the formula to apply the required labeling rules.
Kiswara Agung Santoso +3 more
openalex +3 more sources
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
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