Excerpt from Isomorphism of Strongly Regular Graphs We also say these graphs are z- mngly m. The definition of a k-strongly regular graph is similar: we require, for all h g k, that be dependent solely on the isomorphism type of the subgraph of G induced by the vertiffes Clearly, a (k+l) About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at ... This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally ...
Read More
Excerpt from Isomorphism of Strongly Regular Graphs We also say these graphs are z- mngly m. The definition of a k-strongly regular graph is similar: we require, for all h g k, that be dependent solely on the isomorphism type of the subgraph of G induced by the vertiffes Clearly, a (k+l) About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at ... This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Read Less
Add this copy of Isomorphism of Strongly Regular Graphs Classic Reprint to cart. $14.49, new condition, Sold by Paperbackshop rated 4.0 out of 5 stars, ships from Bensenville, IL, UNITED STATES, published 2018 by Forgotten Books.
