Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Detour Number of 1-Fault Connected Graphs
View through CrossRef
A subset S of a connected graph G of order n is called a detour set of G if for every vertex x in G there exist vertices u; v in S such that x lie on a u – v detour path. The detour number dn( G) of a graph G is the minimum cardinality of a detour set. In this paper we compute the detour number of certain 1-fault connected planar graphs.
SAGE Publications
Title: Detour Number of 1-Fault Connected Graphs
Description:
A subset S of a connected graph G of order n is called a detour set of G if for every vertex x in G there exist vertices u; v in S such that x lie on a u – v detour path.
The detour number dn( G) of a graph G is the minimum cardinality of a detour set.
In this paper we compute the detour number of certain 1-fault connected planar graphs.
Related Results
Integration Techniques of Fault Detection and Isolation Using Interval Observers
Integration Techniques of Fault Detection and Isolation Using Interval Observers
An interval observer has been illustrated to be a suitable approach to detect and isolate faults affecting complex dynamical industrial systems.
Concerning fault detection, interv...
Deformational Processes Accommodating Slip on an Active Low-Angle Normal Fault, Suckling-Dayman Metamorphic Core Complex, Papua New Guinea
Deformational Processes Accommodating Slip on an Active Low-Angle Normal Fault, Suckling-Dayman Metamorphic Core Complex, Papua New Guinea
<p><b>Detachment faults that can be shown to have slipped at dips <30° in highly extended continental crust are referred to as “Low-Angle Normal Faults” (LANFs). The...
Decomposition and Evolution of Intracontinental Strike‐Slip Faults in Eastern Tibetan Plateau
Decomposition and Evolution of Intracontinental Strike‐Slip Faults in Eastern Tibetan Plateau
Abstract:Little attention had been paid to the intracontinental strike‐slip faults of the Tibetan Plateau. Since the discovery of the Longriba fault using re‐measured GPS data in 2...
The open detour number of a graph
The open detour number of a graph
A set [Formula: see text] is called an open detour set of [Formula: see text] if for each vertex [Formula: see text] in [Formula: see text], either (1) [Formula: see text] is a det...
Chapter 4: Displacement on the southern San Andreas fault
Chapter 4: Displacement on the southern San Andreas fault
The pre-Quaternary geology of the southern Chocolate and Cargo Muchacho mountains correlates with that exposed in San Gorgonio Pass between the Mission Creek and Banning branches o...
Upper Square Free Detour Number of Graphs
Upper Square Free Detour Number of Graphs
In this article we introduce the minimal square free detour sets and investigate the upper square free detour number of a graph. A square free detour set of vertices in a graph is ...
Late Quaternary Activity: Kouma Fault
Late Quaternary Activity: Kouma Fault
The Kouma Fault, located at the northern foot of the Mangshan Mountain in Luoyang City, Henan Province, China, is an active fault newly discovered in the field seismic geological s...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...