Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Upper Square Free Detour Number of Graphs
View through CrossRef
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 called a minimal square free detour set if no proper subset is a square free detour set of the graph The upper square free detour number is the maximum order of its minimal square free detour set of the graph. We also determine the upper square free detour number of standard graphs that supports robotics path planning and biological network analysis for efficient navigation.
Title: Upper Square Free Detour Number of Graphs
Description:
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 called a minimal square free detour set if no proper subset is a square free detour set of the graph The upper square free detour number is the maximum order of its minimal square free detour set of the graph.
We also determine the upper square free detour number of standard graphs that supports robotics path planning and biological network analysis for efficient navigation.
Related Results
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...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Spectrum Detour Graf N-Partisi Komplit
Spectrum Detour Graf N-Partisi Komplit
Matriks detour dari graf G adalah matriks yang elemen ke-(i,j) merupakan panjang lintasan terpanjang antara titik Vj di G. Himpunan nilai eigen matriks detour dari graf terhubung l...
Detour Number of 1-Fault Connected Graphs
Detour Number of 1-Fault Connected Graphs
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 detou...
Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs
Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs
A graph is called $P_t$-free if it does not contain a $t$-vertex path as an induced subgraph. While $P_4$-free graphs are exactly cographs, the structure of $P_t$-free graphs for ...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Upper g- Eccentric Domination in Fuzzy Graphs
Upper g- Eccentric Domination in Fuzzy Graphs
Objectives: To introduce a contemporary aspect notorious as upper g-eccentric point set, upper g-eccentric number, upper g-eccentric dominating set, upper g-eccentric domination nu...