Results 51 to 60 of about 1,883 (72)
Upper k-tuple domination in graphs [PDF]
Graph ...
Gerard Jennhwa Chang +5 more
doaj +1 more source
Random graphs with bounded maximum degree: asymptotic structure and a logical limit law [PDF]
General
Vera Koponen
doaj +1 more source
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs [PDF]
A maximum stable set in a graph G is a stable set of maximum cardinality. S is called a local maximum stable set of G if S is a maximum stable set of the subgraph induced by the closed neighborhood of S.
Levit, Vadim E., Mandrescu, Eugen
core
On Symmetry of Independence Polynomials
An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching. If s_{k} is
Levit, Vadim E., Mandrescu, Eugen
core +2 more sources
Graphs with many vertex-disjoint cycles [PDF]
Graph ...
Dieter Rautenbach, Friedrich Regen
doaj +1 more source
On paths, trails and closed trails in edge-colored graphs [PDF]
Graph ...
Laurent Gourvès +3 more
doaj +1 more source
Weighted Well-Covered Claw-Free Graphs [PDF]
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G, the
Levit, Vadim E., Tankus, David
core
Secure frameproof codes through biclique covers [PDF]
Graph ...
Hossein Hajiabolhassan +1 more
doaj +1 more source
A note on planar Ramsey numbers for a triangle versus wheels [PDF]
Graph ...
Guofei Zhou +3 more
doaj +1 more source
The Interaction Between PDE and Graphs in Multiscale Modeling
In this article an upscaled model is presented, for complex networks with highly clustered regions exchanging some abstract quantities in both, microscale and macroscale level.
Morales, Fernando A +1 more
core +2 more sources

