Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
ON CO-SEGREGATED GRAPHS
View through CrossRef
A connected graph G is totally segregated if every pair of adjacent vertices has distinct degrees. In this article, the class of graphs called co-segregated graphs which are complements of totally segregated graphs is discussed. The maximum size of connected totally segregated graph is found by finding minimum size of a large class of co-segregated graphs. We provide an algorithm to find minimum size of co-segregated graph. A construction of co-segregated graph of order n with minimum size is also described.
Title: ON CO-SEGREGATED GRAPHS
Description:
A connected graph G is totally segregated if every pair of adjacent vertices has distinct degrees.
In this article, the class of graphs called co-segregated graphs which are complements of totally segregated graphs is discussed.
The maximum size of connected totally segregated graph is found by finding minimum size of a large class of co-segregated graphs.
We provide an algorithm to find minimum size of co-segregated graph.
A construction of co-segregated graph of order n with minimum size is also described.
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...
Another Approach to Roughness of Soft Graphs with Applications in Decision Making
Another Approach to Roughness of Soft Graphs with Applications in Decision Making
Fuzzy sets, rough sets and soft sets are different tools for modeling problems involving uncertainty. Graph theory is another powerful tool for representing the information by mean...
CO-SEGREGATED POLYNOMIAL OF GRAPHS
CO-SEGREGATED POLYNOMIAL OF GRAPHS
A graph $G$ is co-segregated if $\text{deg}_G(x)=\text{deg}_G(y),$ then $xy \in E(G)$. The co-segregated polynomial of a graph $G$ of order $n$ is given by $CoS(G,x)=\sum_{k=1}^{n}...