Computer Science
8 years ago

New Study Reveals Graphs Can Be Up-Embeddable, Changing Network Design!

1 view
Applied Mathematics Letters
Up-embeddability of graphs with small order
Shengxiang Lv, Yanpei Liu

Paper Summary

The article shows that certain types of graphs with specific characteristics can be embedded in a certain way. If a graph meets certain conditions related to its size and connectivity, it can be embedded in a particular manner. This finding is based on the Moore bound of the graph and can be applied to graphs with different degrees and girths.

Related papers

Theme background image
Mathematics
2 years ago

New Graph Inequalities Settle Conjecture, Revolutionize Local Structure Analysis.

Graph Spectra
Graph Theory
Bayesian Monte Carlo
Theme background image
Computer Science
3 years ago

New Graph Labeling Technique Promises Breakthrough in Network Security!

Graph Labeling
Theme background image
Mathematics
3 years ago

New formula predicts graph connectivity with unprecedented accuracy and efficiency!

Graph Spectra
Drug Discovery
Organic Aromaticity