Results 21 to 30 of about 1,255 (121)
, 2023 Tema ovog diplomskog rada su distancijsko regularni grafovi. Rad se sastoji od četiri poglavlja i dodatka. Nakon uvoda u teoriju grafova definirani su distancijsko regularni grafovi i dana su njihova osnovna svojstva.
Škufca, Kristina
core
Classification of small class association schemes coming from certain combinatorial objects
, 2005 We explore two- or three-class association schemes. We study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra.
Kim, Joohyung
core +1 more source
Developments on Spectral Characterizations of Graphs
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core +2 more sources
Linear codes with few weights from weakly regular bent functions based on a generic construction [PDF]
, 2015 We contribute to the knowledge of linear codes with few weights from special polynomials and functions. Substantial efforts (especially due to C. Ding) have been directed towards their study in the past few years.
Mesnager, Sihem, Sihem Mesnager
core +1 more source
Seidel-equivalence of strongly regular graphs
, 1968 Seidel-equivalence of two strongly regular graphs G and G∗ with the same parameters is defined. Necessary conditions for the existence of partially balanced incomplete block designs with L2(4) and pseudo-T(8) association schemes are also obtained.
Shrikhande, S. S., Bhagawandas,
core +1 more source
Applications of Schur rings in algebraic combinatorics: graphs, partial difference sets and cyclotomic schemes [PDF]
, 2001 The concept of Schur rings was introduced in 1933 by I. Schur. For several decades applications of Schur rings were restricted to the investigation of permutation groups.
Heinze, Aiso
core
PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).
, 1984 A strongly regular graph can be design partitioned if the vertices of the graph can be partitioned into two sets V and B such that V is a coclique and every vertex in B is adjacent to the same number of vertices in V.
GOSSETT, ERIC JAMES.
core
, 2012 We explore directed strongly regular graphs (DSRGs) and their connections to association schemes and finite incidence structures. More specically, we study flags and antiflags of finite incidence structures to provide explicit constructions of DSRGs.
Olmez, Oktay
core +1 more source
Codes in distance-regular graphs [PDF]
, 2013 In this dissertation we study distance-regular graphs. In particular, we look for codes inside them and study triple intersection numbers that we can calculate when certain Krein parameters vanish.
Vidali, Janoš
core
Pseudocyclic association schemes arising from the actions of PGL(2,2m) and PΓL(2,2m)
, 2005 The action of PGL(2,2m) on the set of exterior lines to a nonsingular conic in PG(2,2m) affords an association scheme, which was shown to be pseudocyclic in [H.D.L.
Xiang, Qing +3 more
core +1 more source