On Strongly Regular Graphs withμ= 1
Copyright policy )On Strongly Regular Graphs withμ= 1
The paper looks at strongly regular graphs in which each pair of non-adjacent vertices has exactly one common neighbour. Relationships between the parameters of such graphs are explored as are some of the associated particle linear spaces and distance-regular graphs.
- University of Botswana Botswana
Distance in graphs, distance-regular graph, Computational Theory and Mathematics, Graphs and linear algebra (matrices, eigenvalues, etc.), partial quadrangle, Association schemes, strongly regular graphs, Geometry and Topology, strongly regular graphs, Theoretical Computer Science
Distance in graphs, distance-regular graph, Computational Theory and Mathematics, Graphs and linear algebra (matrices, eigenvalues, etc.), partial quadrangle, Association schemes, strongly regular graphs, Geometry and Topology, strongly regular graphs, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!