Result: Characterizing symmetric diametrical graphs of order 12 and diameter 4
Title:
Characterizing symmetric diametrical graphs of order 12 and diameter 4
Authors:
Source:
International Journal of Mathematics and Mathematical Sciences, Vol 30, Iss 3, Pp 145-149 (2002)
Publisher Information:
Wiley, 2002.
Publication Year:
2002
Subject Terms:
diametrical graph, 4. Education, Study of Finite Groups and Graphs, Combinatorial Mathematics and Algebraic Combinatorics, Distance-Regular Graphs, Computer science, 01 natural sciences, Algorithm, Computational Theory and Mathematics, Physical Sciences, Computer Science, QA1-939, FOS: Mathematics, Discrete Mathematics and Combinatorics, Structural characterization of families of graphs, 0101 mathematics, diameter, Graphs, Mathematics, Graph Theory and Algorithms
Document Type:
Academic journal
Article<br />Other literature type
File Description:
application/xml
Language:
English
ISSN:
1687-0425
0161-1712
0161-1712
DOI:
10.1155/s0161171202012474
DOI:
10.60692/q2ajd-v3y31
DOI:
10.60692/qkrjt-dwj08
Access URL:
Rights:
CC BY
Accession Number:
edsair.doi.dedup.....afb67c27e0e20c34bbd7f04f63181e2c
Database:
OpenAIRE
Further Information
A diametrical graph G is said to be symmetric if for all u, v ∈ V(G), where is the buddy of u. If moreover, G is bipartite, then it is called an S‐graph. It would be shown that the Cartesian product K2 × C6 is not only the unique S‐graph of order 12 and diameter 4, but also the unique symmetric diametrical graph of order 12 and diameter 4.