Highly irregular bipartite graphs

MaRDI QIDQ1917732zbMATH OpenFDO

Authors Yanyan Li

Publication date 15 July 1996

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

highly irregular bipartite graphshighly irregular graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Review text

A connected graph is called highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper an upper bound for the size of a highly irregular graph of order \(2n + 1\) is given. This bound is better than the bound given by Alavi et al. Furthermore all highly irregular graphs whose complements are also highly irregular are characterized, and highly irregular bipartite graphs of orders \(n \neq 3, 5, 7\) are constructed. In addition, it is shown that there is a highly irregular bipartite graph with bipartite size \((n,n)\) and with maximum degree \(m\) for \(n \geq m \geq 3\).

Recommendations

• Highly irregular graphs
• Highly irregular graphs with extreme numbers of edges
• Regularizing irregular graphs
• Highly irregular m-chromatic graphs
• Degree sequences of highly irregular graphs

Cited in

(9)

• Highly irregular m-chromatic graphs
• Regularizing irregular graphs
• Highly irregular graphs with extreme numbers of edges
• scientific article; zbMATH DE number 436072 (Why is no real title available?)
• scientific article; zbMATH DE number 4177116 (Why is no real title available?)
• Highly irregular graphs
• scientific article; zbMATH DE number 4128837 (Why is no real title available?)
• scientific article; zbMATH DE number 568781 (Why is no real title available?)
• On the irregularity of bipartite graphs

This page was built for publication: Highly irregular bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917732)