Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Hub-integrity graph of graphs
View through CrossRef
The hub-integrity graph of a graph is a graph with , where is the set of all nonempty -sets of and is the set of all vertices belonging to , and with two vertices adjacent if and -set of containing . In this paper, we initiate the study of this new graph valued function, and characterizations are given for graphs whose hub-integrity graphs are trees. Also some properties of this graph are established.
مخطط كفاءة المحور للمخطط G هو المخطط ذات الرؤوس حيث S مجموعة كل المجموعات غير الخالية -sets و مجموعة كل الرؤوس المنتمية الى ولأي رأسين متجاورة اذا كان وهومجموعة كل-setالتي تحوي الرأس . في هذا البحث انشأنا دراسة لمخطط جديد لدوال القيمة, وعممنا المخططات التي مخطط كفاءة المحور لها عباره عن مخطط أشجار, أيضا ناقشنا بعض الخصائص لهذا المخطط.
Title: Hub-integrity graph of graphs
Description:
The hub-integrity graph of a graph is a graph with , where is the set of all nonempty -sets of and is the set of all vertices belonging to , and with two vertices adjacent if and -set of containing .
In this paper, we initiate the study of this new graph valued function, and characterizations are given for graphs whose hub-integrity graphs are trees.
Also some properties of this graph are established.
مخطط كفاءة المحور للمخطط G هو المخطط ذات الرؤوس حيث S مجموعة كل المجموعات غير الخالية -sets و مجموعة كل الرؤوس المنتمية الى ولأي رأسين متجاورة اذا كان وهومجموعة كل-setالتي تحوي الرأس .
في هذا البحث انشأنا دراسة لمخطط جديد لدوال القيمة, وعممنا المخططات التي مخطط كفاءة المحور لها عباره عن مخطط أشجار, أيضا ناقشنا بعض الخصائص لهذا المخطط.
.
Related Results
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...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
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...
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...
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...
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...
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...