DSpace at ATMIYA UNIVERSITY: Recent submissions

  • 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 ...
  • Retrofitting & Extension of Two Floors in School Building 
    Bhadra, Shivani; Bavishi, Dhvanil; Gondaliya, Kevin; Vekariya, Arjun; parekh, Mayank (Journal of Emerging Technologies and Innovative Research (JETIR), 2019-01)
    strengthening of the RC columns is required due to the design errors; damage due to earthquake or changes in the functionality of the structure, etc. This project involves the repair and retrofitting of G+3 storey school ...
  • Open packing number of some path related graphs 
    Vaidya, S.K.; Parmar, A.D. (Journal of Applied Science and Computations, 2019-05)
    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 chromatic transversal domination in graphs 
    Vaidya, S.K.; Parmar, A.D. (Malaya Journal of Matematik, 2019)
    A proper k - coloring of a graph G is a function f : V(G) → {1,2,..., k} such that f(u) 6= f(v) for all uv ∈ E(G). The color class Si is the subset of vertices of G that is assigned to color i. The chromatic number χ(G) ...
  • Some new results on chromatic transversal domination in graphs 
    Vaidya, S.K.; Parmar, A.D. (International Journal of Mathematical Sciences and Engineering Applications, 2019-06)
    A vertex dominating set D of V (G) is called a chromatic transversal dominating set of G if D intersects every color class of G. The minimum cardinality of D is called a chromatic transversal domination number of G. In ...
  • Application of Taguchi method in activated carbon adsorption process of phenol removal from ceramic gasifier wastewater 
    Lunagariya, Jagniyant; Chabhadiya, Karan; Pathak, Pankaj; Mashru, Deepak (Elsevier, 2022-01)
    Ceramic gasifier wastewater (CGWW) contains organic toxic substances such as phenolic compounds and direct disposal of CGWW into the ground and surface water causes severe environmental impacts. Therefore, phenol removal ...
  • About -ve domination in graphs 
    Thakkar, D.K.; Jamvecha, Neha P. (Annals of Pure and Applied Mathematics, 2017-09-06)
    The paper is about the ve-domination (vertex-edge domination) in graphs. Necessary and sufficient conditions are proved under which the ve-domination number decreases or increases.
  • On edge-edge domination in graphs 
    Thakkar, D.K.; Jamvecha, N.P. (International Journal of Mathematical Archive, 2017-06)
    In this paper we further study the concept of edge-edge domination in graphs. We observe that the edge-edge domination number of a graph may increase or decrease or remains same when a edge is removed from a graph. We ...