Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
On The Geometrisability Of Some Strongly Regular Graphs Related To Polar Spaces., Pratima Panigraphi Dr.
On The Geometrisability Of Some Strongly Regular Graphs Related To Polar Spaces., Pratima Panigraphi Dr.
Doctoral Theses
GraphsA graph G = (VE) consists of a finite set V and a subset E of ). (Here () denotes the set of all 2-subsets of V.) Elements of Vare called the vertices and the elements of E are called the edges of the graph. So Vis the vertex set and E is the edge set of the graph G. Two vertices a, y are said to be adjacent if the pair {a, y} is an edge; otherwise they are non-adjacent. If two vertices are adjacent then each is called a neighbour of the other vertex.Sometimes the edges of a …
A Study In Geometric Construction, Nichola Sue Mcclain
A Study In Geometric Construction, Nichola Sue Mcclain
Theses Digitization Project
No abstract provided.
Cyclic Cutwidth Of Three Dimensional Cubes, Ray N. Gregory
Cyclic Cutwidth Of Three Dimensional Cubes, Ray N. Gregory
Theses Digitization Project
No abstract provided.