| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vaidya, S. K. | - |
| dc.contributor.author | Parmar, A. D. | - |
| dc.date.accessioned | 2024-11-21T07:32:10Z | - |
| dc.date.available | 2024-11-21T07:32:10Z | - |
| dc.date.issued | 2018 | - |
| dc.identifier.citation | Vaidya, S. K., & Parmar, A. D. (2018). Total Equitable Bondage Number of a Graph. Journal of Scientific Research, 10(3).J. Sci. Res. 10 (3), 231-238 (2018 | en_US |
| dc.identifier.issn | 2070-0237 | - |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1856 | - |
| dc.description.abstract | 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 dominating set is called the total equitable domination number denoted by γte (G). 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). We introduced the concept of total equitable bondage number and proved several results. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Scientific Research | en_US |
| dc.subject | Equitable Bondage | en_US |
| dc.subject | Number of a Graph | en_US |
| dc.title | Total Equitable Bondage Number of a Graph | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 01. Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Total Equitable Bondage number of a graph.pdf | 301.97 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.