Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
The open detour number of a graph
View through CrossRef
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 detour simplicial vertex of [Formula: see text] and [Formula: see text] or (2) [Formula: see text] is an internal vertex of an [Formula: see text]-[Formula: see text] detour for some [Formula: see text]. An open detour set of minimum cardinality is called a minimum open detour set and this cardinality is the open detour number of [Formula: see text], denoted by [Formula: see text]. Connected graphs of order [Formula: see text] with open detour number [Formula: see text] or [Formula: see text] are characterized. It is shown that for any two positive integers [Formula: see text] and [Formula: see text] with [Formula: see text], there exists a connected graph [Formula: see text] such that [Formula: see text] and [Formula: see text], where [Formula: see text] is the detour number of [Formula: see text]. It is also shown that for every pair of positive integers [Formula: see text] and [Formula: see text] with [Formula: see text] and [Formula: see text], there exists a connected graph [Formula: see text] such that [Formula: see text] and [Formula: see text], where [Formula: see text] is the open geodetic number of [Formula: see text].
World Scientific Pub Co Pte Ltd
Title: The open detour number of a graph
Description:
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 detour simplicial vertex of [Formula: see text] and [Formula: see text] or (2) [Formula: see text] is an internal vertex of an [Formula: see text]-[Formula: see text] detour for some [Formula: see text].
An open detour set of minimum cardinality is called a minimum open detour set and this cardinality is the open detour number of [Formula: see text], denoted by [Formula: see text].
Connected graphs of order [Formula: see text] with open detour number [Formula: see text] or [Formula: see text] are characterized.
It is shown that for any two positive integers [Formula: see text] and [Formula: see text] with [Formula: see text], there exists a connected graph [Formula: see text] such that [Formula: see text] and [Formula: see text], where [Formula: see text] is the detour number of [Formula: see text].
It is also shown that for every pair of positive integers [Formula: see text] and [Formula: see text] with [Formula: see text] and [Formula: see text], there exists a connected graph [Formula: see text] such that [Formula: see text] and [Formula: see text], where [Formula: see text] is the open geodetic number of [Formula: see text].
Related Results
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 ...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
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...
Bootstrapping a Biodiversity Knowledge Graph
Bootstrapping a Biodiversity Knowledge Graph
The "biodiversity knowledge graph" is a nice metaphor for connecting biodiversity data sources, but can we actually build it? Do we have sufficient linked data available? Given tha...
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...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
The quadrangle graph operator
The quadrangle graph operator
The cycle graph of a graph G is the graph [Formula: see text] whose vertices are the induced cycles of G and where two vertices are adjacent if and only if they are distinct induce...