• Few Results on Paired Domination Number of Some Graphs 

  Isaac, Rakhimol; Pandya, Parashree (Solovyov Studies ISPU, 2023)

  The paired dominating set D of graph G is the subset of vertex set of graph G such that the subset D is dominating set and the subgraph induced by D contains perfect Matching. The paired domination number is the minimum ...
• Congruent Domination Number of Graphs Obtained by Means of Some Graph Operation 

  Jadeja, M. R.; Vadhel, H. D.; Parmar, A. D. (Journal of Applied Science and Computations, 2023-08)
• SOME NEW CLASSES OF EQUIENERGETIC GRAPHS 

  Popat, Kalpesh M (2022-08-30)

  The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E(G) of graph G is the sum of absolute values of its eigenvalues. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...
• 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 ...
• Spectra of Graphs Obtained by Duplication of Graph Elements 

  Vaidya, Samir K; Popat, Kalpesh M (2019-12)

  The concept of graph energy is a frontier between two important branches of basic sciences: namely, Mathematics and Chemistry. The sum of absolute values of eigenvalues of adjacency matrix of graph is called the energy ...
• CONSTRUCTION OF L-BORDERENERGETIC GRAPHS 

  . VAIDYA, SAMIR K; POPAT, KALPESH M (2021)

  If a graph G of order n has the Laplacian energy same as that of complete graph Kn then G is said to be L-borderenergeic graph. It is interesting and challenging as well to identify the graphs which are L-borderenergetic ...
• Construction of sequences of borderenergetic graphs 

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

  The graphs whose energy is same as that of complete graphs are known as borderenergetic graphs. We propose a procedure for the construction of borderenergetic graphs and investigate three sequences of borderenergetic graphs.
• Some New Results on Seidel Equienergetic Graphs 

  Vaidya, Samir K; Popat, Kalpesh M (2019-05-10)

  The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. Some variants of energy can also be found in the litera- ture, in which the energy is de_ned for the Laplacian ...
• ON EQUIENERGETIC, HYPERENERGETIC AND HYPOENERGETIC GRAPHS 

  VAIDYA, SAMIR K; POPAT, KALPESH M (2018-06-15)

  The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E(G) is the sum of absolute values of eigenvalues of graph G. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...
• Shortest distance between two vertices in connected graph using TJ – adjacency of vertices and minimum dominating set 

  Bhatt, Tushar; Zalavadiya, Jayesh; Teraiya, Om (Journal of Emerging Technologies and Innovative Research (JETIR), 2018-12)

  Domination theory is a part of Graph theory is used for finding communities in networks, device for modeling, description of real world network systems such are : Transport, Water, Electricity, Internet and many more. ...
• Perfect domination number of path graph Pn and its Corona product with another path graph Pn−1 

  Bhatt, Tushar; Bhimani, G. (Malaya Journal of Matematik, 2021)

  According to the research paper on Perfect Dominating Sets by Marilynn Livingston and Quentin F. Stout[1]they have been constructed the PDSs in families of graphs arising from the interconnected networks of parallel computers ...
• In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem (LPP) solution method namely, Graphical method. By help of this domination model we can get basic feasible solution of LPP and hence we are trying to minimize the limitations of graphical method for solving LPP. 

  Bhatt, Tushar; Bhimani, G. (Kala : The Journal of Indian Art History Congress, 2021)

  An Ad-hoc network is one that is spontaneously formed when device connect and communicate with each other. It is mostly wireless local area network (WLANs). The devices communicate with each other directly instead of ...
• Application of Domination Theory in Operation Research: The Domination Model of Graphical Method for solving LPP with two variables 

  Bhatt, Tushar; Bhimani, G. (Journal of Science, KCG-portal of Journals, 2020-05)

  In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...
• Domination Model of Graphical Method for Solving LPP 

  Bhatt, Tushar; Bhimani, G. (International Journal of Research in Humanities & Soc. Sciences, 2020-04)

  In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...
• Edge domination number of Jump Graph : A comparative Study 

  Bhatt, Tushar; Bhimani, G. (Journal of Emerging Technologies and Innovative Research (JETIR), 2019-06)

  In this paper we are trying to find that the domination number of any graph is obtain by using familiar method as vertex domination techniques and edge domination techniques but from the both who one is faster than ...
• Product Cordial Labeling for some Bistar related Graphs 

  Vaidya, S.; Vyas, N. (AMO - Advanced Modeling and Optimization, 2014)

  For the graph G = (V (G), E(G)), a function f : V (G) → {0, 1} is called a product cordial labeling of G if the induced edge labeling function defined by the product of end vertex labels be such that the edges with label ...
• Product cordial labeling for alternate snake graphs 

  Vaidya, S.; Vyas, N. (Malaya Journal of Matematic (MJM) - An International Journal of mathematical science with computer applications, 2014)

  The product cordial labeling is a variant of cordial labeling. Here we investigate product cordial labeling for alternate triangular snake and alternate quadrilateral snake graphs
• Some More Results on Even Mean Labeling 

  Vaidya, S.; vyas, N. (International Journal of Graph Theory(IJOGT), 2013-12)

  A function f: V(G) →{2,4, …, 2|E(G)|} is called an even mean labeling of graph G if it is injective and when each edge e=uv is labeled with average sum of f(u) and f(v) then the resulting edge labels are distinct. Here ...
• Even Mean Labeling for Path and Bistar related Graphs 

  Vaidya, S.; Vyas, N. (International Journal of Graph Theory(IJOGT), 2013-08)

  An even mean labeling is a variant of mean labeling. Here we investigate even mean labeling for path and bistar related graphs.
• Antimagic Labeling of Some Path and Cycle Related Graphs 

  Vaidya, S.; Vyas, N. (Annals of Pure and Applied Mathematics, 2013)

  An edge labeling of a graph is a bijection from E(G) to the set {1,2,… , |E(G)|}. If for any two distinct vertices u and v, the sum of labels on the edges incident to u is different from the sum of labels on the edges ...

View more