Neighbourly Irregular Derived Graphs
Authors
Abstract:
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
similar resources
neighbourly irregular derived graphs
a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
full textNeighbourly Regular Strength of Bipartite Graphs
A graph is said to be a neighbourly irregular graph (or simply an NI graph) if every pair of its adjacent vertices have distinct degrees. Let G be a simple graph of order n. Let NI(G) denote the set of all NI graphs in which G is an induced subgraph. The neighbourly regular strength of G is denoted by NRS(G) and is defined as the minimum positive integer k for which there is an NI graph in NI(G...
full textMaximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs
Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (M.Mahdian, On the computational complexity of strong edge coloring, Discrete Applied Mathematics, 118:239–248, 2002) proved that it is in polynomial time for quadrilateral-f...
full textExtremely Irregular Graphs
The irregularity of a graph G is defined as irr(G) = ∑ |d(x) − d(y)| where d(x) is the degree of vertex x and the summation embraces all pairs of adjacent vertices of G. We characterize the graphs minimum and maximum values of irr.
full textIrregular Bipolar Fuzzy Graphs
In this paper, we define irregular bipolar fuzzy graphs and its various classifications. Size of regular bipolar fuzzy graphs is derived. The relation between highly and neighbourly irregular bipolar fuzzy graphs are established. Some basic theorems related to the stated graphs have also been presented.
full textOn maximally irregular graphs
Let G be a connected graph with maximum degree ∆(G). The irregularity index t(G) of G is defined as the number of distinct terms in the degree sequence of G. We say that G is maximally irregular if t(G) = ∆(G). The purpose of this note, apart from pointing out that every highly irregular graph is maximally irregular, is to establish upper bounds on the size of maximally irregular graphs and max...
full textMy Resources
Journal title
volume 8 issue 1
pages 53- 60
publication date 2017-03-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023