Browsing 01. Journal Articles by Author "Vaidya, S. K"

Now showing items 1-4 of 4

Construction of L-equienergetic graphs using some graph operations

Vaidya, S. K; Popat, Kalpesh M (2019)

For a graph G with n vertices and m edges, the eigenvalues of its adjacency matrix A(G) are known as eigenvalues of G. The sum of absolute values of eigenvalues of G is called the energy of G. The Laplacian matrix of G is ...
On chromatic transversal domination in graphs

Vaidya, S. K; Parmar, A. D. (Malaya Journal of Matematik, 2019)

A subset S of vertices of G is an open packing of G if the open neighborhoods of the vertices of S are pairwise disjoint in G while open packing number of G is the maximum cardinality among all the open packing sets of ...
On restrained domination number of some wheel

Vaidya, S. K; Ajani, P. D (Malaya Journal of Matematik,, 2019)

For a graph G = (V, E), a set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. The minimum cardinality of a restrained dominating set of G is called ...
Restrained Edge Domination Number of Some Path Related Graphs

Vaidya, S. K; Ajani, P. D (JSR Publications, 2021)

For a graph, a set is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in The minimum cardinality of a restrained ...

Now showing items 1-4 of 4

Search DSpace