A note on intersecting graphs.

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.

On the domination of functions by graphs

S. F. Kapoor, Linda M. Lesniak (1976)

Colloquium Mathematicae

Similarity:

SOUR graphs for efficient completion.

Lynch, Christopher, Strogova Polina (1998)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Dominant-matching graphs

Igor&#039; 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.

A Note On Graphs Representable As Product Graphs

Zlatomir Lukić (1982)

Publications de l'Institut Mathématique

Similarity:

γ-labelings of complete bipartite graphs

Grady D. Bullington, Linda L. Eroh, Steven J. Winters (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Explicit formulae for the γ-min and γ-max labeling values of complete bipartite graphs are given, along with γ-labelings which achieve these extremes. A recursive formula for the γ-min labeling value of any complete multipartite is also presented.