DSpace Repository

Browsing 01. Journal Articles by Author "Parmar, A. D."

Browsing 01. Journal Articles by Author "Parmar, A. D."

Sort by: Order: Results:

  • 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)
  • 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)
    Abstract A dominating set is said to be a congruent dominating set of a graph if . The minimum cardinality of a minimal congruent dominating set of is called the congruent domination number of which is denoted by . In ...
  • On chromatic transversal domination in graphs 
    Vaidya, S. K; Parmar, A. D. (Malaya Journal of Matematik, 2019)
    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 total domination and total equitable domination in graphs 
    Vaidya, S. K.; Parmar, A. D. (Malaya Journal of Matematik, 2018)
    The bondage number of a nonempty graph is the minimum cardinality among all sets of edges for which. An equitable dominating set is called a total equitable dominating set if the induced subgraph has no isolated vertices. ...
  • Open Packing Number of Some Path Related Graphs 
    Vaidya, S. K.; Parmar, A. D. (JASC: Journal of Applied Science and Computations, 2018)
    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 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∈V(G) - D there exists a vertex u ∈ D such that uv∈E(G) and |d(v) - d(u)|≤ 1 then D is called the total equitable dominating set. The minimum cardinality of the total equitable ...

Search DSpace


Advanced Search

Browse

My Account