Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
????‐constructibility of planar graphs
View through CrossRef
AbstractIn this paper, the concept of the ????‐constructibility of graphs is introduced and investigated with particular reference to planar graphs. It is conjectured that the planar graphs are minimally N‐constructible, where N is a finite set of graphs and an infinite set ???? is obtained such that the planar graphs are also minimally ????‐constructible. Finally, some properties of the set of all N‐constructible graphs are discussed and compared with the corresponding properties of planar graphs.
Title: ????‐constructibility of planar graphs
Description:
AbstractIn this paper, the concept of the ????‐constructibility of graphs is introduced and investigated with particular reference to planar graphs.
It is conjectured that the planar graphs are minimally N‐constructible, where N is a finite set of graphs and an infinite set ???? is obtained such that the planar graphs are also minimally ????‐constructible.
Finally, some properties of the set of all N‐constructible graphs are discussed and compared with the corresponding properties of planar graphs.
Related Results
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...
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...
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...
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...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets
Abstract
The independent domination number
i
(
G
) of a graph...
Planar graphs without adjacent cycles of prescribed lengths are 3-colorable∗
Planar graphs without adjacent cycles of prescribed lengths are 3-colorable∗
About Steinberg’s conjecture and Erd˝os’s open question on the 3coloring in planar graphs, it is left the following challenging question: whether every planar graph without cycles ...