The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On k-closure operators in graphs. II”

Requiring that Minimal Separators Induce Complete Multipartite Subgraphs

Terry A. McKee (2018)

Discussiones Mathematicae Graph Theory

Similarity:

Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the classical chordal graphs and the emergent unichord-free graphs. New theorems characterize several subclasses of the graphs whose minimal separators induce complete multipartite subgraphs, in particular the graphs that are 2-clique sums...

A Characterization for 2-Self-Centered Graphs

Mohammad Hadi Shekarriz, Madjid Mirzavaziri, Kamyar Mirzavaziri (2018)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing edge-minimal 2-self-centered graphs into two cases. First, we characterize edge-minimal 2-self-centered graphs without triangles by introducing specialized bi-independent covering (SBIC) and a structure named generalized complete bipartite graph (GCBG)....

Supermagic Generalized Double Graphs 1

Jaroslav Ivančo (2016)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.

Dominant-matching graphs

Igor' E. Zverovich, Olga I. Zverovich (2004)

Discussiones Mathematicae Graph Theory

Similarity:

We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.

Remarks on the existence of uniquely partitionable planar graphs

Mieczysław Borowiecki, Peter Mihók, Zsolt Tuza, M. Voigt (1999)

Discussiones Mathematicae Graph Theory

Similarity:

We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (𝓓₁,𝓓₁)-partitionable planar graphs with respect to the property 𝓓₁ "to be a forest".

Some globally determined classes of graphs

Ivica Bošnjak, Rozália Madarász (2018)

Czechoslovak Mathematical Journal

Similarity:

For a class of graphs we say that it is globally determined if any two nonisomorphic graphs from that class have nonisomorphic globals. We will prove that the class of so called CCB graphs and the class of finite forests are globally determined.