An efficient -centroid location algorithm for cographs.

Prakash, V.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “An efficient $g$ -centroid location algorithm for cographs.”

Graphs in which each pair of vertices has exactly two common neighbours

Bohdan Zelinka (1993)

Mathematica Bohemica

Similarity:

The paper studies graphs in which each pair of vertices has exactly two common neighbours. It disproves a conjectury by P. Hliněný concerning these graphs.

Recognizing the $P_{4}$ -structure of claw-free graphs and a larger graph class.

Babel, Luitpold, Brandstädt, Andreas, Le, Van Bang (2002)

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

Similarity:

Distance domination and distance irredundance in graphs.

Hansberg, Adriana, Meierling, Dirk, Volkmann, Lutz (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A new upper bound on the total domination number of a graph.

Henning, Michael A., Yeo, Anders (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On graphs with isomorphic, non-isomorphic and connected $N_{2}$ -neighbourhoods

Zdeněk Ryjáček (1987)

Časopis pro pěstování matematiky

Similarity:

On the graphs with maximum distance or $k$ -diameter

Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)

Mathematica Slovaca

Similarity:

The graph of labellings of a given graph

Bohdan Zelinka (1988)

Mathematica Slovaca

Similarity:

Displaying similar documents to “An efficient g -centroid location algorithm for cographs.”

Graphs in which each pair of vertices has exactly two common neighbours

Recognizing the P 4 -structure of claw-free graphs and a larger graph class.

Distance domination and distance irredundance in graphs.

A new upper bound on the total domination number of a graph.

On graphs with isomorphic, non-isomorphic and connected N 2 -neighbourhoods

On the graphs with maximum distance or k -diameter

The graph of labellings of a given graph

Displaying similar documents to “An efficient $g$ -centroid location algorithm for cographs.”

Recognizing the $P_{4}$ -structure of claw-free graphs and a larger graph class.

On graphs with isomorphic, non-isomorphic and connected $N_{2}$ -neighbourhoods

On the graphs with maximum distance or $k$ -diameter