Some More Results on Total Equitable Bondage Number of A Graph

Total Equitable Bondage Number of A Graph

Authors

  • S. K. Vaidya Department of MathematicsSaurashtra UniversityRajkot-360 005GujaratIndia
  • A. D. Parmar Atmiya Institute of Technology & Science for Diploma Studies https://orcid.org/0000-0003-0410-0167

DOI:

https://doi.org/10.3329/jsr.v11i3.40573

Abstract

The bondage number b(G) of a nonempty graph G is the minimum cardinality among all sets of edges E0 ⊆ E(G) for which γ(G-E0) > γ (G). An equitable dominating set D is called a total equitable dominating set if the induced subgraph < D > has no isolated vertices. The total equitable domination number γte(G) of G is the minimum cardinality of a total equitable dominating set of G. If γte(G) ≠ |V(G)| and <G-E0> contains no isolated vertices then the total equitable bondage number bte(G) of a graph G is the minimum cardinality among all sets of edges E0 ⊆ E(G) for which γte(G-E0) > γte(G). In the present work we prove some characterizations and investigate total equitable bondage number of Ladder and degree splitting of path.

Downloads

Download data is not yet available.
Abstract
20
PDF
32

Author Biography

S. K. Vaidya, Department of MathematicsSaurashtra UniversityRajkot-360 005GujaratIndia

Professor

Deapartment of Mathematics

Downloads

Published

2019-09-01

How to Cite

Vaidya, S. K., & Parmar, A. D. (2019). Some More Results on Total Equitable Bondage Number of A Graph: Total Equitable Bondage Number of A Graph. Journal of Scientific Research, 11(3), 303–309. https://doi.org/10.3329/jsr.v11i3.40573

Issue

Vol. 11 No. 3 (2019)

Section

Section A: Physical and Mathematical Sciences

License

© Journal of Scientific Research

Creative Commons License

Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.