Results 1 to 10 of about 142,839 (168)
On the limit value of compactness of some graph classes. [PDF]
PLoS ONE, 2018 In this paper, we study the limit of compactness which is a graph index originally introduced for measuring structural characteristics of hypermedia. Applying compactness to large scale small-world graphs (Mehler, 2008) observed its limit behaviour to be
Tatiana Lokot +2 more
doaj +2 more sources
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes [PDF]
Logical Methods in Computer Science, 2023 The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes ...
Jan Dreier
doaj +1 more source
Minimal toughness in special graph classes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Let $t$ be a positive real number. A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components, and all graphs are considered 0-tough. The toughness of a graph is the largest $t$ for which
Gyula Y. Katona, Kitti Varga
doaj +1 more source
Information, 2022 We study classes of geometric graphs, which all correspond to the following structural characteristic. For each instance of a vertex set drawn from a universe of possible vertices, each pair of vertices is either required to be connected, forbidden to be
Lucas Böltz, Hannes Frey
doaj +1 more source
Commuting conjugacy classes graph of the generalized dihedral and dicyclic groups [PDF]
ریاضی و جامعه, 2023 Suppose $G$ is a finite non-abelian group and $\Gamma(G)$ is a simple graph with the non-central conjugacy classes of $G$ as its vertex set. Two different non-central conjugacy classes $A$ and $B$ are assumed to be adjacent if and only if there are ...
Mohammadali Salahshour
doaj +1 more source
Commuting Conjugacy Class Graph of G when G / Z(G)~=D2n [PDF]
Mathematics Interdisciplinary Research, 2020 Suppose G is a finite non-abelian group and Γ(G) is a simple graph with the non-central conjugacy classes of G as its vertex set. Two different noncentral conjugacy classes C and B are assumed to be adjacent in Γ(G) if and only if there are elements a ...
Mohammad Ali Salahshour
doaj +1 more source
Graph automorphisms for compression
Open Computer Science, 2020 Detecting automorphisms is a natural way to identify redundant information presented in structured data. When such redundancies are detected they can be used for data compression.
Čibej Uroš, Mihelič Jurij
doaj +1 more source
Anti-Path Cover on Sparse Graph Classes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We show that it is possible to use Bondy-Chvatal closure to design an FPT algorithm that decides whether or not it is possible to cover vertices of an input graph by at most k vertex disjoint paths in the complement of the input graph. More precisely, we
Pavel Dvořák +2 more
doaj +1 more source
Tropical Graph Parameters [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lovász and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph classes of ...
Nadia Labai, Johann Makowsky
doaj +1 more source
Graph Classes Generated by Mycielskians
Discussiones Mathematicae Graph Theory, 2020 In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above sequence is a generator ...
Borowiecki Mieczys law +3 more
doaj +1 more source