Yazar "Mathad, Veena" için listeleme
-
Amplified eccentric connectivity index of graphs
Mathad, Veena; H. N., Sujatha; S., Puneeth (Işık University Press, 2022)A new distance based graphical index, coined as amplified eccentric connectivity index, has been established and the formulae to calculate the amplified eccentric connectivity index of some standard graphs, Dutch windmill ... -
Bharath hub number of graphs
Mathad, Veena; Anand; Shivakumar, Puneeth (Işık University Press, 2023-04)The mathematical model of a real world problem is designed as Bharath hub number of graphs. In this paper, we study the graph theoretic properties of this variant. Also, we give results for Bharath hub number of join and ... -
Eccentricity based topological indices of some graphs
Padmapriya, P.; Mathad, Veena (Işık University Press, 2020)Topological indices are real numbers that are presented as graph parameters introduced during studies conducted on the molecular graphs in chemistry and can describe some physical and chemical properties of molecules. In ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ... -
Hub-integrity polynomial of graphs
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2020)Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we introduce a ... -
Neighborhub number of graphs
Mathad, Veena; Khalaf, Shadi Ibrahim; Raikar, Vidya (Işık University Press, 2022)Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that for any pair of vertices outside of S, there is a path between them with all intermediate vertices in S and G = S Uv?S < ... -
On hubtic and restrained hubtic of a graph
Khalaf, Shadi Ibrahim; Mathad, Veena (Işık University Press, 2019-05-07)In this article, the hubtic number of the join and corona of two connected graphs is computed. The restrained hubtic number ξr(G) of a graph G is the maximum number such that we can partition V (G) into pairwise disjoint ... -
Topological indices of Sierpi?ski Gasket and Sierpi?ski Gasket Rhombus graphs
Padmapriya, P.; Mathad, Veena (Işık University Press, 2022)Sierpi?ski graphs S(n, k) were defined originally in 1997 by Sandi Klav?ar and Uroš Milutinovi?. In this paper atom bond connectivity index, fourth atom bond connectivity indices, geometric arithmetic index, fifth geometric ...
