Results 1 to 10 of about 8,211 (183)
Sampling theory of jointly bandlimited time-vertex graph signals
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
openaire +2 more sources
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 ...
openaire +2 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.
Zhang, Yongfei +5 more
openaire +2 more sources
A Generalization of a Theorem of Diderrich in Additive Group Theory to Vertex-transitive Graphs
European Journal of Combinatorics, 1996 Consider a vertex-transitive (finite) directed graph \(X=(V,E)\). Let \(\kappa (X)\) be its connectivity number in directed sense. As known, each indegree and each outdegree in \(X\) equals \(|E|/ |X|\). Denote this number by \(d\). It is shown that \(d= \kappa (X)\) if there is no transitive triangle in \(X\).
openaire +2 more sources
Iwasawa theory for vertex-weighted graphs
29 pages, 8 ...
Murooka, Ryosuke, Tateno, Sohei
openaire +2 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
openaire +1 more source
Online Graph Topology Learning via Time-Vertex Adaptive Filters: From Theory to Cardiac Fibrillation
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
openaire +2 more sources
Note on extremal problems about connected subgraph sums. [PDF]
Graphs CombCambie S, Groenland C.
europepmc +1 more source
Zeta functions of quaternion weighted graphs (Research on algebraic combinatorics and representation theory of finite groups and vertex operator algebras)グラフのゼータ関数は, 伊原[6]により定義された伊原ゼータ関数が起源である. 伊原ゼータ関数は, PGL(2, mathbb{Q}_{p})の捻れのない余コンパクトな離散部分群rから定まるセルバーグゼータ関数の類似であり, 母関数型表示と行列式表示を持つことが[6]において示された. その後, Serre[15]により, 伊原ゼータ関数は, SL(2, mathbb{Q}_{p})に付随したBruhat-Tits tree(無限正則木)のrによる商グラフ(有限正則グラフ)のゼータ関数であることが示唆され, 砂田[17, 18]によってグラフのゼータ関数が確立された. その後多くの研究者の貢献により, グラフのゼータ関数は大きく発展した.
openaire
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Theory Comput SystBentert M, Fomin FV, Golovach PA.
europepmc +1 more source