Results 11 to 20 of about 8,148 (148)
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
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 +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 +2 more sources
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
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
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
A paradigmatic approach to investigate restricted hyper totient graphs
AIMS Mathematics, 2021 Nowadays, the problem of finding families of graphs for which one may ensure the existence of a vertex-labeling and/or an edge-labeling based on a certain class of integers, constitutes a challenge for researchers in both number and graph theory. In this
Shahbaz Ali +2 more
doaj +1 more source