S. Pirzada, T. A. Naikoo, Farooq Ahmad Dar, S. Arumugam
Abstract
A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V) be a signed bipartite graph with U = {u1, u2, …, up} and V = {u1, u2, …, uq}....
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V) be a signed bipartite graph with U = {u1, u2, …, up} and V = {u1, u2, …, uq}....
Key concepts: Signed graph, Bipartite graph, Mathematics, Combinatorics, Complete bipartite graph, Edge-transitive graph, Discrete mathematics, Graph