Bipartite diametrical graphs of diameter 4 and extreme orders

DOI10.1155/2008/468583zbMath1161.05316OpenAlexW1999809183WikidataQ58644774 ScholiaQ58644774MaRDI QIDQ938489

Salah Al-Addasi, Hassan Al-Ezeh

Publication date: 19 August 2008

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55353

zbMATH Keywords

matroidrhombic dodecahedronS-graphbipartite diametrical graphbipartite self complementary graphpartite sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

D-Levels locally homogeneous graphs ⋮ On \(k\)-pairable regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the structure of the tight-span of a totally split-decomposable metric
• Basis graphs of even delta-matroids
• Unique eccentric point graphs
• Cross-cloning and antipodal graphs
• r-partite self-complementary graphs-diameters
• Characterizing symmetric diametrical graphs of order 12 and diameter 4
• On \(k\)-pairable graphs
• Even graphs
• n‐cubes and median graphs
• Quasi‐median graphs and algebras

This page was built for publication: Bipartite diametrical graphs of diameter 4 and extreme orders