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
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
