Results 271 to 280 of about 29,610 (306)
Some of the next articles are maybe not open access.
2001
In this chapter we return to the theme of combinatorial regularity with the study of strongly regular graphs. In addition to being regular, a strongly regular graph has the property that the number of common neighbours of two distinct vertices depends only on whether they are adjacent or nonadjacent.
Chris Godsil, Gordon Royle
openaire +1 more source
In this chapter we return to the theme of combinatorial regularity with the study of strongly regular graphs. In addition to being regular, a strongly regular graph has the property that the number of common neighbours of two distinct vertices depends only on whether they are adjacent or nonadjacent.
Chris Godsil, Gordon Royle
openaire +1 more source
Regular two-graphs from strongly regular graphs
2022In this talk we will give a classification of strongly regular graphs with parameters (41, 20, 9, 10) that have a nontrivial automorphism. We will talk about the construction of regular two-graphs with 42 vertices from these strongly regular graphs and about the construction of regular two-graphs with 38 vertices.
Maksimović, Marija, Rukavina, Sanja
openaire
A Generalization of Strongly Regular Graphs
Southeast Asian Bulletin of Mathematics, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deza, Michel, Huang, Tayuan
openaire +2 more sources
On strongly regular self ‐ complementary graphs
Journal of Graph Theory, 1981AbstractIt is shown that certain conditions assumed on a regular self‐complementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].
openaire +1 more source
Regular and Strongly Regular Selfcomplementary Graphs
1982The graphs given in the title are studied using boolean techniques. First we investigate the change of certain simple graphical parameters (like the number of triangles through a vertex) of a regular self-complementary graphs under a complementing permutation.
openaire +1 more source
Strongly regular and distance-regular graphs
2016In this chapter, we discuss the basic notions and results from the theory of strongly regular and distance-regular graphs. Emphasis will be on those results that will have implications to the study of point-line geometries. A more extensive treatment of these families of graphs can be found in the books [6, 25, 69, 70].
openaire +1 more source
Hematology and oncology clinical care during the coronavirus disease 2019 pandemic
Ca-A Cancer Journal for Clinicians, 2020Manish A Shah +2 more
exaly
Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm
Nature Methods, 2021Haoyu Cheng +2 more
exaly

