Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
The Forcing Circular Number of a Graph
View through CrossRef
Let S be a cr-set of graph G and let G be a connected graph. If S is the only cr-set that contains T, then a subset T⊆S is referred to be a forcing subset for S. A minimum forcing subset of S is a forcing subset for S of minimum cardinality. The cardinality of a minimum forcing subset of S is the forcing circular number of S, represented by the notation f_cr(S). f_cr (G) = min {f_cr(S)} is the forcing circular number of G, where the minimum is the sum of all minimum forcing circular-sets S in G. For several standard graphs, the forcing circular number is identified. It is demonstrated that there exists a connected graph G such that f_g (G)=a and f_cr (G)=b for every integer a≥0, and b≥0.
Title: The Forcing Circular Number of a Graph
Description:
Let S be a cr-set of graph G and let G be a connected graph.
If S is the only cr-set that contains T, then a subset T⊆S is referred to be a forcing subset for S.
A minimum forcing subset of S is a forcing subset for S of minimum cardinality.
The cardinality of a minimum forcing subset of S is the forcing circular number of S, represented by the notation f_cr(S).
f_cr (G) = min {f_cr(S)} is the forcing circular number of G, where the minimum is the sum of all minimum forcing circular-sets S in G.
For several standard graphs, the forcing circular number is identified.
It is demonstrated that there exists a connected graph G such that f_g (G)=a and f_cr (G)=b for every integer a≥0, and b≥0.
Related Results
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...
Methodological architectonics of inclusive circular economy for eco-security of society under pandemic
Methodological architectonics of inclusive circular economy for eco-security of society under pandemic
The transition from a linear to a circular economy is determined by the change in the positioning of global risks from year to year, which determines the vectors of such changes. T...
Financing the Circular Economy: a European Perspective
Financing the Circular Economy: a European Perspective
Abstract. Introduction For the development of the circular economy, many countries have begun to actively use various tools and mechanisms of public policy to ensure its complexity...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
Some Methodological Issues in Assessing the Efforts for the Circular Economy by Region or Country
Some Methodological Issues in Assessing the Efforts for the Circular Economy by Region or Country
At present, the circular economy is emerging as a strategy for sustainable development. What is important in promoting the circular economy is to assess its current level and take ...
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
The locating coloring of graph extends the vertex coloring dan partition dimension of graph. The minimum number of locating coloring of graph G is called the locating chromatic num...