• No results found

An efficient g centroid location algorithm for cographs

N/A
N/A
Protected

Academic year: 2020

Share "An efficient g centroid location algorithm for cographs"

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

Loading

References

Related documents

Given a graph G and an integer k, does G contain a spanning tree such that all vertices in the tree have degree at most k (obviously, only tree edges count towards the degree)?.

In this paper, we present an optimal algorithm to find a next-to-shortest path between any two vertices of a cactus graph with n vertices which runs in time.. Keywords:

The Total chromatic number (G) of a graph G is the minimum number of colours needed to colour the edges and the vertices of G so that incident or adjacent

The fractional strong match- ing preclusion number (FSMP number) of G , denoted by f smp ( G ), is the minimum number of vertices and edges whose deletion leaves the resulting

For any biconnected outerplanar graph G having maximum vertex-degree A>3 and m edges, let A'. be the maximum vertex-degree and let m' be the number of edges of

In this paper, the unique graph on n vertices with maximum signless Lapla- cian Estrada index is determined among graphs with given number of cut edges, pendent vertices,

In this paper, we obtain the bounds on the number of edges, vertices, domatic number, and domination number of the minimal dominating graph and vertex minimal dominating graph of

In this paper, Split edge domination number of Boolean Function Graph B(G, L(G), NINC) of some standard graphs and its bounds are obtained... Let D and D be the sets of edges