Displaying similar documents to “On the determining number and the metric dimension of graphs.”

Distinguishing infinite graphs.

Imrich, Wilfried, Klavžar, Sandi, Trofimov, Vladimir (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A Characterization of 2-Tree Probe Interval Graphs

David E. Brown, Breeann M. Flesch, J. Richard (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P. We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by Pržulj and Corneil in [2-tree probe interval graphs have a large obstruction set, Discrete Appl....