Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Complete (2,2) Bipartite Graphs
View through CrossRef
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other. In this article, analogous to complete (1,1) bipartite graphs which have the maximum number of pairs of vertices having distance one between them, a complete (2,2) bipartite graph is defined as follows. A complete (2,2) bipartite graph is a graph which is (2,2) bipartite and has the maximum number of pairs of vertices (u,v) such that d(u,v)=2. Such graphs are characterized and their properties are studied. The expressions are derived for the determinant, the permanent and spectral properties of some classes of complete (2,2) bipartite graphs. A class of graphs among complete (2,2) bipartite graphs having golden ratio in their spectrum is obtained.
Universiti Putra Malaysia
Title: Complete (2,2) Bipartite Graphs
Description:
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other.
A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
In this article, analogous to complete (1,1) bipartite graphs which have the maximum number of pairs of vertices having distance one between them, a complete (2,2) bipartite graph is defined as follows.
A complete (2,2) bipartite graph is a graph which is (2,2) bipartite and has the maximum number of pairs of vertices (u,v) such that d(u,v)=2.
Such graphs are characterized and their properties are studied.
The expressions are derived for the determinant, the permanent and spectral properties of some classes of complete (2,2) bipartite graphs.
A class of graphs among complete (2,2) bipartite graphs having golden ratio in their spectrum is obtained.
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...
Fidelity and entanglement of random bipartite pure states: insights and applications
Fidelity and entanglement of random bipartite pure states: insights and applications
Abstract
We investigate the fidelity of Haar random bipartite pure states from a fixed reference quantum state and their bipartite entanglement. By plotting the fide...
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...
On Bipartite Distance-Regular Cayley Graphs with Small Diameter
On Bipartite Distance-Regular Cayley Graphs with Small Diameter
We study bipartite distance-regular Cayley graphs with diameter three or four. We give sufficient conditions under which a bipartite Cayley graph can be constructed on the semidire...
Hardness and algorithmic results for Roman \{3\}-domination
Hardness and algorithmic results for Roman \{3\}-domination
A Roman $\{3\}$-dominating function on a graph $G = (V, E)$ is a function $f: V \rightarrow \{0, 1, 2, 3\}$ such that for each vertex $u \in V$, if $f(u) = 0$ then $\sum\limits_{v ...
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...