Sujata Timmanaikar

• Assistant Professor at Government Engineering College, Haveri

The equitable total dominating graph () of a graph = (,) is the graph with the vertex set ∪ where is the collection of all minimal equitable total dominating sets of with two vertices , ∈ ∪ adjacent in () if ∈ and is a minimal equitable total dominating set in containing. In this paper, we initiate a study of this new graph and obtain basic propert...

Coumarins, a subgroup of colorless and crystalline oxygenated heterocyclic compounds originally discovered in the plant Dipteryx odorata, were the subject of a recent study investigating their quantitative structure-activity relationship (QSAR) in cancer pharmacotherapy. This study utilized graph theoretical molecular descriptors, also known as top...

The accurate domination number of graph G denoted by) (G a  is the cardinality of a smallest set D that is dominating set of G and no  | | D element subset of D V G  is a dominating set of. G In this paper, we characterized the graphs with equal accurate domination number and maximal domination number() (=) (G G m a  ). Further, we obtained va...

In the mathematical literature several transformation graphs have been considered and constructed. Let G denote the set of simple undirected graphs. Various important results in graph theory have been obtained by considering some functions F : G → G or F s : G 1 × …× G s → G called transformations or operations (here each G i = G) and by establishi...

Let be a graph. The distance (,) between the vertices and of the graph is equal to the length of the shortest path that connects and. The Wiener index () is the sum of distances between all pairs of vertices of , whereas the hyper-Wiener index () is defined as () = 1 2 (,)⊆ () (,) + (,) 2. In this paper Wiener and hyper-Wiener indices are obtained...

The first Zagreb index of a graph is the sum of squares of the degrees of the vertices of. In this paper expressions for the first Zagreb index, first Za-greb coindex and forgotten indices are obtained for dominating transformation(d-transformations) graphs of Kragujevac tree .