Results 11 to 20 of about 5,334 (178)
Strong cliques and forbidden cycles
Indagationes Mathematicae, 2020 Given a graph $G$, the strong clique number $ω_2'(G)$ of $G$ is the cardinality of a largest collection of edges every pair of which are incident or connected by an edge in $G$. We study the strong clique number of graphs missing some set of cycle lengths.
Wouter Cames van Batenburg +2 more
openaire +6 more sources
Tight Algorithmic Applications of Clique-Width Generalizations [PDF]
, 2023 In this work, we study two natural generalizations of clique-width introduced by Martin Fürer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], while for fusion-width (fw) we have a possibility to merge all vertices of a ...
Chekan, Vera, Kratsch, Stefan
core +1 more source
Digital homotopy relations and digital homology theories
Applied General Topology, 2021 In this paper we prove results relating to two homotopy relations and four homology theories developed in the topology of digital images. We introduce a new type of homotopy relation for digitally continuous functions which we call ``strong homotopy ...
P. Christopher Staecker
doaj +1 more source
Structural Parameterizations of Clique Coloring [PDF]
, 2020 A clique coloring of a graph is an assignment of colors to its vertices such that no maximal clique is monochromatic. We initiate the study of structural parameterizations of the Clique Coloring problem which asks whether a given graph has a clique ...
Lima, Paloma T. +2 more
core +1 more source
Strong cliques in vertex‐transitive graphs [PDF]
Journal of Graph Theory, 2020 AbstractA clique (resp, independent set) in a graph is strong if it intersects every maximal independent set (resp, every maximal clique). A graph is clique intersect stable set (CIS) if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques. In this paper we prove that a clique in a vertex‐
openaire +2 more sources
Visual cryptography scheme on graphs with $m^{*}(G)=4$ [PDF]
Transactions on Combinatorics, 2019 Let $G=(V,E)$ be a connected graph and $\Gamma (G)$ be the strong access structure where obtained from graph $G$. A visual cryptography scheme (VCS) for a set $P$ of participants is a method to encode a secret image such that any pixel of this image ...
Mahmood Davarzani
doaj +1 more source
Maximum Clique in Disk-Like Intersection Graphs [PDF]
, 2020 We study the complexity of Maximum Clique in intersection graphs of convex objects in the plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks [Clark '90, Raghavan and Spinrad '03] to translates of any fixed convex set ...
Grelier, Nicolas +6 more
core +2 more sources
Emergence of Leadership in Communication. [PDF]
PLoS ONE, 2016 We study a neuro-inspired model that mimics a discussion (or information dissemination) process in a network of agents. During their interaction, agents redistribute activity and network weights, resulting in emergence of leader(s).
Armen E Allahverdyan, Aram Galstyan
doaj +1 more source
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products
Entropy, 2023 This paper provides new observations on the Lovász θ-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs.
Igal Sason
doaj +1 more source
Network connections, dyadic bonds and fitness in wild female baboons [PDF]
Royal Society Open Science, 2016 In many social mammals, females who form close, differentiated bonds with others experience greater offspring survival and longevity. We still know little, however, about how females' relationships are structured within the social group, or whether ...
Dorothy L. Cheney +2 more
doaj +1 more source