Generalization of bipartite graphs

DOI10.1080/09720529.2019.1701269zbMath1482.05092OpenAlexW3005793435MaRDI QIDQ5034514

P. Siva Kota Reddy, P. Hemavathi

Publication date: 18 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1701269

zbMATH Keywords

bipartite graphindependent set\((i, j)\)-bipartite graph\(D_k\)-graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• End-regular and End-orthodox generalized lexicographic products of bipartite graphs
• Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers
• An extendable stable matching algorithm of a kind of bipartite graph

This page was built for publication: Generalization of bipartite graphs