DSpace Repository

Browsing 01. Journal Articles by Title

Browsing 01. Journal Articles by Title

Sort by: Order: Results:

  • Characteristic polynomials of some algebraic graphs 
    Vaidya, S.K.; Jadeja, M.R. (Malaya Journal of Matematik, 2020)
    The zero divisor graph Γ(R) of a commutative ring R is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The characteristic polynomial of matrix M is defined ...
  • Composite Weiner Hopf Equation with Variational Inequality and Equilibrium Problem 
    Rathee, S; Swami, M. (Communications in Mathematics and Applications, 2021)
    In this paper, we introduce an iteration based on composite Weiner-Hopf equation technique to find the common solution of the set of solution of composite generalized variational inequality, set of equilibrium problem and ...
  • 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 ...
  • CONVERGENCE RATE OF VARIOUS ITERATIONS WITH SM-ITERATION FOR CONTINUOUS FUNCTION 
    Rathee, S.,; Swami, M. (J. Math. Comput. Sci.,, 2020)
    In the present paper, we propose a new iteration process named as SM-iteration and compare its rate of convergence with the already existing iterations such as CR, S, Abbas, Thakur for different type of functions with the ...
  • 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 ...
  • E-Cordial Labeling for Cartesian Product of Some Graphs 
    Vaidya, S.; Vyas, N. (Studies in Mathematical Sciences, CSCanada, 2011-11)
    We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 and K1,n × P2 are E-cordial for n odd.
  • E-Cordial Labeling in the Context of Switching of a Vertex 
    Vaidya, S.; Vyas, N. (International Journal of Advanced Computer and Mathematical Sciences, 2012)
    Let G=(V(G),E(G)) be a graph and f E G : ( ) {0,1} → be a binary edge labeling. Define * f V G : ( ) {0,1} → by * ( ) ( ) ( )( 2) uv E G f v f uv mod ∈ = ∑ . The function f is called E-cordial labeling of G if | ...
  • E-Cordial Labeling of Some Mirror Graphs 
    Vaidya, S.; Vyas, N. (International Journal of Contemporary Advanced Mathematics (IJCM), 2011)
    Let G be a bipartite graph with a partite sets V1 and V2 and G′ be the copy of G with corresponding partite sets V1 ′ and V2 ′ . The mirror graph M(G) of G is obtained from G and G′ by joining each vertex of V1 ...
  • 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 ...
  • 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.
  • 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 ...
  • 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.
  • 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 ...
  • 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 ...
  • INTERNATIONAL JOURNAL OF MATHEMATICAL COMBINATORICS EDITED B 
    Mao, L. (International Journal of Mathematical Combinatorics, 2019)
    The mathematical combinatorics is a subject that applying combinatorial notion to all mathematics and all sciences for understanding the reality of things in the universe, motivated by CC Conjecture of Dr.Linfan MAO on ...
  • METRIC DIMENSION OF GRAPHS OBTAINED FROM COMMUTATIVE RING 
    VAIDYA, S; JADEJA, M (Advances and Applications in Mathematical Sciences, 2022)
    For a connected graph of order n, the metric basis of a G is a smallest set {} k v vv S,,, 2 =1 of vertices of G such that for vertex, G u∈ the ordered k-tuples of are all distinct.distances {()()()()} k vud vud vud ...
  • 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) ...
  • 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 ...
  • On kasaj generalized closed sets in kasaj topological spaces 
    Rachchh, Kashyap G.; Soneji, Asfak A.; Ghanchi, Sajeed I. (Journal of Emerging Technologies and Innovative Research, 2020-12)
    We introduced Kasaj topological spaces which is a partial extension of Micro topological space which is introduced by S. Chandrasekar. We also analyzed basic properties of some weak open sets in Kasaj topological spaces. ...
  • On Kasaj topological spaces 
    Rachchh, Kashyap G.; Ghanchi, Sajeed I. (Malaya Journal of Matematik, 2020-10)
    In year 2013, L. Thivagar et al. introduced nano topological space and he analysed some properties of weak open sets. In this paper we shall introduce Kasaj-topological space. We shall introduce some new classes of weak ...

Search DSpace


Advanced Search

Browse

My Account