Results 11 to 20 of about 21,593 (217)
The dominating partition dimension and locating-chromatic number of graphs
Electronic Journal of Graph Theory and Applications, 2023 For every graph G, the dominating partition dimension of G is either the same as its partition dimension or one higher than its partition dimension.
Muhammad Ridwan +2 more
doaj +1 more source
On the Isometric Path Partition Problem
Discussiones Mathematicae Graph Theory, 2021 The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph.
Manuel Paul
doaj +1 more source
Asymptotic results on Klazar set partition avoidance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We establish asymptotic bounds for the number of partitions of $[n]$ avoiding a given partition in Klazar's sense, obtaining the correct answer to within an exponential for the block case. This technique also enables us to establish a general lower bound.
Ryan Alweiss
doaj +1 more source
AROUND THE ERDÖS–GALLAI CRITERION
Ural Mathematical Journal, 2023 By an (integer) partition we mean a non-increasing sequence \(\lambda=(\lambda_1, \lambda_2, \dots)\) of non-negative integers that contains a finite number of non-zero components. A partition \(\lambda\) is said to be graphic if there exists a graph \(G\
Vitaly A. Baransky, Tatiana A. Senchonok
doaj +1 more source
AGAT: Building and evaluating binary partition trees for image segmentation
SoftwareX, 2021 AGAT is a Java library dedicated to the construction, handling and evaluation of binary partition trees, a hierarchical data structure providing multiscale partitioning of images and, more generally, of valued graphs. On the one hand, this library offers
Jimmy Francky Randrianasoa +3 more
doaj +1 more source
Parallel Learning of Dynamics in Complex Systems
Systems, 2022 Dynamics always exist in complex systems. Graphs (complex networks) are a mathematical form for describing a complex system abstractly. Dynamics can be learned efficiently from the structure and dynamics state of a graph.
Xueqin Huang +4 more
doaj +1 more source
Multiresolution equivariant graph variational autoencoder
Machine Learning: Science and Technology, 2023 In this paper, we propose Multiresolution Equivariant Graph Variational Autoencoders (MGVAE), the first hierarchical generative model to learn and generate graphs in a multiresolution and equivariant manner. At each resolution level, MGVAE employs higher
Truong Son Hy, Risi Kondor
doaj +1 more source
Good quality virtual realization of unit disk graphs
Journal of Computational Geometry, 2011 We consider the problem of finding a realization of an n-vertex unit disk graph (UDG) expressed in general form, say, as an adjacency matrix. The problem is to construct an embedding of the graph in low-dimensional Euclidean space so that the ratio of ...
Sriram Pemmaraju, Imran Pirwani
doaj +3 more sources
On the Computational Complexity of Optimization Convex Covering Problems of Graphs [PDF]
Computer Science Journal of Moldova, 2020 In this paper we present further studies of convex covers and convex partitions of graphs. Let $G$ be a finite simple graph. A set of vertices $S$ of $G$ is convex if all vertices lying on a shortest path between any pair of vertices of $S$ are in $S ...
Radu Buzatu
doaj
New Results of Multi-Agent Controllability Under Equitable Partitions
IEEE Access, 2020 This paper studies the controllability of leader-follower multi-agent systems under fixed topology. The relationship between controllability and information communication topologies is characterized by taking advantage of equitable partitions.
Yanhong Lou, Zhijian Ji, Jijun Qu
doaj +1 more source