Results 1 to 10 of about 183,679 (180)
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
openaire +3 more sources
On the Vertex-Connectivity of an Uncertain Random Graph
IEEE Access, 2020 In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which ...
Hao Li, Xin Gao
doaj +3 more sources
Graph Signal Processing: Dualizing GSP Sampling in the Vertex and Spectral Domains [PDF]
IEEE Transactions on Signal Processing, 2021 Vertex based and spectral based GSP sampling has been studied recently. The literature recognizes that methods in one domain do not have a counterpart in the other domain.
John Shi, J. Moura
semanticscholar +1 more source
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
ALGORITMO DE COBERTURA DE VÉRTICES
Revista Ingeniería, Matemáticas y Ciencias de la Información, 2023 Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematicaldiscipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph isincident to at least
Javier López Wong
doaj +1 more source
Note on the temperature Sombor index
Vojnotehnički Glasnik, 2023 Introduction/purpose: The temperature of a vertex of a graph of the order n is defined as d/(n-d), where d is the vertex degree. The temperature variant of the Sombor index is investigated and several of its properties established. Methods: Combinatorial
Ivan Gutman
doaj +1 more source
Barekeng, 2022 Graph theory is a mathematics section that studies discrete objects. One of the concepts studied in graph theory is the restrained dominating set which aims to find the restrained dominating number.
Landerius Maro +2 more
doaj +1 more source
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Mathematics, 2022 Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang +4 more
doaj +1 more source
On Critical Sampling of Time-Vertex Graph Signals [PDF]
IEEE Global Conference on Signal and Information Processing, 2019 Joint time-vertex graph signals are pervasive in real-world. This paper focuses on the fundamental problem of sampling and reconstruction of joint time-vertex graph signals.
Junhao Yu, Xuan Xie, Hui Feng, Bo Hu
semanticscholar +1 more source