DSpace at ATMIYA UNIVERSITY: Recent submissions

  • Equitable restrained domination number of some graphs 
    Vaidya, S.K.; Ajani, P.D. (Malaya Journal of Matematik, 2020)
    A dominating set S ⊆ V is said to be a restrained dominating set of graph G if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. A set S ⊆ V is called an equitable dominating set if for ...
  • On restrained edge dominating set of graphs 
    Vaidya, S.K.; Ajani, P.D. (Malaya Journal of Matematik, 2020)
    For a graph G = (V,E), a subset D of E is restrained edge dominating set of G if every edge not in D is adjacent to an edge in D as well as an edge in E −D. The restrained edge domination number of G, denoted by γre(G) is ...
  • On restrained domination number of some wheel related graphs 
    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 ...
  • The Imperial Education Of 21st Century: A Study Of India’s Roaring Lion Edtech Byju’s And It’s Hunting 
    Dave, Parth; Thaker, Jayen (Sambodhi (UGC Care Journal), 2020-12)
    This paper presents a new way of thinking and getting education in different ways. At most use of technology can be blessing in worst situation. This COVID-19 pandemic situation in the year 2020 made people realize that ...
  • Restrained domination number of some path related graphs 
    Vaidya, S.K.; Ajani, P.D. (Journal of Computational Mathematica, 2017)
    A dominating set S ⊆ V (G)of a graph G is called restrained dominating set if every vertex in V (G) - S is adjacent to a vertex in S and to a vertex in V (G) - S. The restrained domination number of G, denoted by γ_r (G), ...
  • Workplace Social Support As Enhancing Quality Of Life & Employee’s Productivity 
    Khandhar, Virali K.; Dadhich, Meghashree A. (Journal of the Maharaja Sayajirao University of Baroda, 2022)
    Humans are social beings, and for many people it is true that they spend more time at work with their co-workers than with their spouse or family. As humans, we crave contact and connection with other people. Work relationships ...
  • Some new classes of equienergetic graphs 
    Popat, Kalpesh M. (South East Asian Journal of Mathematics and Mathematical Sciences, 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. (AKCE International Journal of Graphs and Combinatorics, Taylor & Francis, 2020)
    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 ...
  • Spectra of graphs obtained by duplication of graph elements 
    Vaidya, Samir K.; Popat, Kalpesh M. (Mathematics Today, 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 sequence of borderenergetic graphs 
    Vaidya, S.K.; Popat, K.M. (Proyecciones (Antofagasta), 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. (Kyungpook Mathematical Journal, 2019)
    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 defined for the Laplacian ...
  • “Runway Excursion: A Problem” 
    Gandhewar, Piyush; Sonkusare, Hemantkumar (IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE), 2014)
    : Landing and takeoff overruns, undershoots, and veer-offs account for most of the accidents that occur on or in the immediate vicinity of the runway. Accident statistics show that, from 1959 to 2009, 55% of the world’s ...
  • A Critical Review on Applicability of HEC-HMS Software for Hydrological Parameter Estimation: A Case Study of Hadamtala Basin 
    Pujara, Hardik; Joshipura, Neha; Joshi, S.B. (IJSRD - International Journal for Scientific Research & Development, 2015)
    Hydrological Parameters estimation and their appropriate use to establish Rainfall-runoff Correlation and various hydrology projects on the particular study area. Various studies like silt, flood, utilization and ...
  • Energy m-splitting and m-shadow graphs 
    Vaidya, Samir K.; Popat, Kalpesh M. (Far East Journal of Mathematical Sciences, 2017)
    We determine the energy of a graph obtained by means of graph operations on a given graph, and relate the energy of such a new graph with that of the given graph.
  • Some new results on energy of graphs 
    Vaidya, Samir K.; Popat, Kalpesh M. (MATCH Communications in Mathematical and in Computer Chemistry, 2017)
    The eigenvalue of a graph G is the eigenvalue of its adjacency matrix. The energy E (G) of G is the sum of absolute values of its eigenvalues. A natural question arises: How the energy of a given graph G can be related ...
  • Experimental study on performance of Marble waste and Glass fiber in concrete for Rigid pavement 
    Makwana, Rohit; Pujara, Hardik; Mathakiya, Asharaf (Gradiva Review Journal, 2021)
    It has construct road in india so far. As flexible and rigid pavement. Now day village road and city corridor. road to use rigid pavement. in India most of state connect in their Capital city. Govt is launch PMGSY to connect ...
  • Experimental mix design approach of reactive powder concrete to recognize compressive strength through non-destructive test 
    Sonkusare, Hemantkumar; Pawade, Prashant; Pujara, Hardik (Journal of Physics: Conference Series,IOP Publishing, 2021)
    Rapid industrialization in concrete industry dominates the infrastructural development globally. Where, the crowded places, old structures, monuments gets maintain and rehabilitate to strengthen then we use high grade ...
  • On total domination in some path related graphs 
    Vaidya, S.K.; Parmar, A.D. (International Journal of Mathematics and Soft Computing, 2017)
    If G is a graph with vertex set V (G) then dominating set D⊆ V (G) is called total if every vertex of V (G) is adjacent to at least one vertex of D while it is called equitable if for every vertex u in V (G)− D there exists ...
  • On total domination and total equitable domination in graphs 
    Vaidya, S.K.; Parmar, A.D. (Malaya Journal of Matematik, 2018)
    A dominating set D of a graph G is called total if every vertex of V (G) is adjacent to at least one vertex of D, equivalently if N (D)= V (G) then D is called total dominating set. A dominating set D is called total ...
  • Total equitable bondage number of a graph 
    Vaidya, S.K.; Parmar, A.D. (Journal of Scientific Research, 2018)
    If for any total dominating set D with ν ∈ V (G) − D there exists a vertex u ∈ D such that uν ∈ E (G) and |d(ν)−d(u)| ≤ 1 then D is called the total equitable dominating set. The minimum cardinality of the total equitable ...