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
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...
Exploring Large Language Models Integration in the Histopathologic Diagnosis of Skin Diseases: A Comparative Study
Exploring Large Language Models Integration in the Histopathologic Diagnosis of Skin Diseases: A Comparative Study
Abstract
Introduction
The exact manner in which large language models (LLMs) will be integrated into pathology is not yet fully comprehended. This study examines the accuracy, bene...
Neighborhood Reconstruction and Cancellation of Graphs
Neighborhood Reconstruction and Cancellation of Graphs
We connect two seemingly unrelated problems in graph theory.Any graph $G$ has a neighborhood multiset $\mathscr{N}(G)= \{N(x) \mid x\in V(G)\}$ whose elements are precisely the ope...
A Novel Method for Community Detection in Bipartite Networks
A Novel Method for Community Detection in Bipartite Networks
The community structure is a major feature of bipartite networks, which serve as a typical model for empirical networks consisting of two kinds of nodes. Over the past years, commu...
A Novel Method for Community Detection in Bipartite Networks
A Novel Method for Community Detection in Bipartite Networks
The community structure is a major feature of bipartite networks, which serve as a typical model for empirical networks consisting of two kinds of nodes. Over the past years, commu...
Hourglass Contractions Complicating Bipartite Placental Delivery
Hourglass Contractions Complicating Bipartite Placental Delivery
Bipartite retained placenta, a rare complication where the placenta remains partially attached due to abnormal separation, can pose significant risks to maternal health. Hourglass ...
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 ...
On Tuza's conjecture in even co-chain graphs
On Tuza's conjecture in even co-chain graphs
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoin...