scientific article; zbMATH DE number 7106979

zbMath1420.05071MaRDI QIDQ5197581

Unnamed Author, P. Paulraja, R. Balakrishnan, Wa-Sin So

Publication date: 19 September 2019

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p017.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automorphism groupinterconnection networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Eigenvalues of Cayley graphs ⋮ Diameter of General Knödel Graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on the broadcast function using minimum dominating sets
• On the number of broadcast schemes in networks
• New gossips and telephones
• Methods and problems of communication in usual networks
• A survey on Knödel graphs.
• The shortest path problem in the Knödel graph
• Tight Bound on the Diameter of the Knödel Graph
• Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
• On the minimum path problem in Knödel graphs
• A survey of gossiping and broadcasting in communication networks
• A Note on the Dimensionality of Modified Knödel Graphs
• Some minimum gossip graphs
• Minimum multiple message broadcast graphs
• A textbook of graph theory

This page was built for publication: