Results 1 to 10 of about 8,383 (243)
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
+5 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 ...
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 ...
Murooka, Ryosuke, Tateno, Sohei
openaire +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.
Zhang, Yongfei +5 more
openaire +3 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\).
Isabelle Salaün
openaire +3 more sources
Relation algebras and vertex conditions in graph theory
, 2018 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
openaire +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
openaire +3 more sources
Relating graph energy with vertex-degree-based energies [PDF]
Vojnotehnički Glasnik, 2020 Introduction/purpose: The paper presents numerous vertex-degree-based graph invariants considered in the literature. A matrix can be associated to each of these invariants.
Ivan Gutman
doaj +1 more source
Graph pebbling number and model [PDF]
ریاضی و جامعه, 2023 There are many topics in graph theory that can be called ``moving objects around a graph". For example; In network optimization, shipments are transferred from some vertices (resources) to other vertices (demand) according to the costs allocated to the ...
Fatemeh Aghaei Meybodi, Saeed Alikhani
doaj +1 more source