A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Inverse Domination in Semi-total Block Graphs

2010
*
International Journal of Computer Applications
*

Let G = (V, E) be a simple, finite, undirected graph with V = n and E = m. Kulli introduced the new graph valued function namely the semi-total block graph of a graph G. Let B 1 = {u 1 ,u 2 ,...,u r , r 2} be a block of G. Then we say that the point u 1 and block B 1 are incident with each other, as are u 2 and B 1, u 3 and B 1 and so on. If two distinct blocks B 1 and B 2 are incident with a common cut point then they are called adjacent blocks. Let B = {B 1 , B 2 ,...,B p } be the set of

doi:10.5120/1231-1806
fatcat:gwzciy7rqbhpxi6yzohrzonl6u