Restrained Isolate Edge Geodetic Number of a Graph
Main Article Content
Abstract
Here we study the new concept of restrained isolate edge geodetic set for a graph of order . The edge geodetic set of a connected graph is said to be a restrained isolate edge geodetic set if the induced sub graph has at least one isolate vertex and the induced sub graph has no isolate vertex. The restrained isolate edge geodetic number denoted by is the minimum cardinality of a restrained isolate edge geodetic set of . Here we determine the restrained isolate edge geodetic number of some standard graphs and by adding leaf vertices to a graph . In addition, we determine the restrained isolate edge geodetic number for some graphs using cartesian product and corona product.
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
