DSpace Repository

Browsing 06. Department of Mathematics by Issue Date

Browsing 06. Department of Mathematics by Issue Date

Sort by: Order: Results:

  • 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 ...
  • Product Cordial Labeling in the Context of Tensor Product of Graphs 
    Vaidya, S.; Vyas, N. (Journal of Mathematics Research, 2011-08)
    For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set V(G1(Tp)G2) = V(G1) × V(G2) and edge set E(G1(Tp)G2) = {(u1, v1), (u2, v2)/u1u2 E(G1) and v1v2 E(G2)}. The graph Pm(Tp)Pn ...
  • 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.
  • Some Results on E-cordial Labeling 
    Vaid, S.; Vyas, N. (International Journal of Mathematics and Scientific Computing, 2012)
    A binary vertex labeling f : E(G) → {0, 1} with induced labeling f ∗ : V (G) → {0, 1} defined by f ∗ P (v) = {f(uv) | uv ∈ E(G)}(mod 2) is called E-cordial labeling of a graph G if the number of vertices labeled 0 ...
  • Antimagic Labeling in the Context of Switching of a Vertex 
    Vaidya, S.; Vyas, N. (Annals of Pure and Applied Mathematics, 2012)
    A graph with q edges is called antimagic if its edges can be labeled with 1, 2,…,q such that the sums of the labels of the edges incident to each vertex are distinct. Here we prove that the graphs obtained by switching ...
  • 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 | ...
  • 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 ...
  • 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.
  • 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 ...
  • 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
  • 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 ...
  • 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 ...
  • 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.
  • 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), ...
  • 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 ...
  • 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 ...
  • On restrained domination number of graphs 
    Vaidya, S.K.; Ajani, P.D. (International Journal of Mathematics and Soft Computing, 2018)
    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 to a vertex in V − S. The smallest cardinality of a restrained dominating set of G is called ...
  • 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. ...
  • 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) ...

Search DSpace


Advanced Search

Browse

My Account