Displaying similar documents to “γ-labelings of complete bipartite graphs”

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.

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.

Some additions to the theory of star partitions of graphs

Francis K. Bell, Dragos Cvetković, Peter Rowlinson, Slobodan K. Simić (1999)

Discussiones Mathematicae Graph Theory

Similarity:

This paper contains a number of results in the theory of star partitions of graphs. We illustrate a variety of situations which can arise when the Reconstruction Theorem for graphs is used, considering in particular galaxy graphs - these are graphs in which every star set is independent. We discuss a recursive ordering of graphs based on the Reconstruction Theorem, and point out the significance of galaxy graphs in this connection.

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.