Results 41 to 50 of about 357,448 (292)
Connectivity Index in Vague Graphs with Application in Construction
Discrete Dynamics in Nature and Society, 2022 The vague graph (VG), which has recently gained a place in the family of fuzzy graph (FG), has shown good capabilities in the face of problems that cannot be expressed by fuzzy graphs and interval-valued fuzzy graphs. Connectivity index (CI) in graphs is
Huiqin Jiang, Yongsheng Rao
doaj +1 more source
From Time–Frequency to Vertex–Frequency and Back
Mathematics, 2021 The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković +5 more
doaj +1 more source
Hopf algebra gauge theory on a ribbon graph [PDF]
Reviews in Mathematical Physics, 2015 We generalize gauge theory on a graph so that the gauge group becomes a finite-dimensional ribbon Hopf algebra, the graph becomes a ribbon graph, and gauge-theoretic concepts such as connections, gauge transformations and observables are replaced by ...
C. Meusburger, D. Wise
semanticscholar +1 more source
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 +1 more source
On partition functions for 3-graphs [PDF]
, 2016 A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model (P.
Regts, Guus +2 more
core +2 more sources
The spectral polynomials of two joining graphs: splices and links
Boletim da Sociedade Paranaense de Matemática, 2022 Energy of a graph, firstly defined by E. Hückel as the sum of absolute values of the eigenvalues of the adjacency matrix, in other words the sum of absolute values of the roots of the characteristic (spectral) polynomials, is an important sub area of ...
Feriha Celik +2 more
doaj +1 more source
Induced minors and well-quasi-ordering [PDF]
, 2018 A graph $H$ is an induced minor of a graph $G$ if it can be obtained from an induced subgraph of $G$ by contracting edges. Otherwise, $G$ is said to be $H$-induced minor-free.
Błasiok, Jarosław +3 more
core +3 more sources
Fast branching algorithm for Cluster Vertex Deletion [PDF]
, 2013 In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges).
A. Ben-Dor +25 more
core +2 more sources
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality [PDF]
International Conference for High Performance Computing, Networking, Storage and Analysis, 2020 We develop the first parallel graph coloring heuristics with strong theoretical guarantees on work and depth and coloring quality. The key idea is to design a relaxation of the vertex degeneracy order, a well-known graph theory concept, and to color ...
Maciej Besta +5 more
semanticscholar +1 more source
Transitive Triangle Tilings in Oriented Graphs [PDF]
, 2017 In this paper, we prove an analogue of Corr\'adi and Hajnal's classical theorem. There exists $n_0$ such that for every $n \in 3\mathbb{Z}$ when $n \ge n_0$ the following holds.
Balogh, József +2 more
core +2 more sources