Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Bounding the diameter of distance-regular graphs (1988)
    Springer
    Combinatorica 8 (1988), S. 333-343 
    Details
    ISSN: 1439-6912
    Keywords: 05 C 99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract LetG be a connected distance-regular graph with valencyk〉2 and diameterd, but not a complete multipartite graph. Suppose thatθ is an eigenvalue ofG with multiplicitym and thatθ≠±k. We prove that bothd andk are bounded by functions ofm. This implies that, ifm〉1 is given, there are only finitely many connected, co-connected distance-regular graphs with an eigenvalue of multiplicitym.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02189090
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    On the p-rank of incidence matrices and a bound of Bruen and Ott (1992)
    Springer
    Designs, codes and cryptography 2 (1992), S. 391-394 
    Details
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Bruen and Ott have derived an interesting lower bound on the p-rank of the incidence matrix of a partial linear space. We derive two extensions of their result.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00125204
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Tournaments with prescribed regular automorphism group (1986)
    Springer
    Aequationes mathematicae 30 (1986), S. 55-64 
    Details
    ISSN: 1420-8903
    Keywords: Primary 05C25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A tournamentX is a TRR for a groupG if (a)G acts regularly on the vertices ofX and (b) Aut(X) is isomorphic toG. We correct some previous work of Babai and Imrich by showing thatZ 2 3 andZ 3 3 are the only groups of odd order without TRR's. Our methods are perhaps of independent interest, since we use a probabilistic approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02189910
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Constructing cospectral graphs (1982)
    Springer
    Aequationes mathematicae 25 (1982), S. 257-268 
    Details
    ISSN: 1420-8903
    Keywords: Primary 05C55 ; Secondary 15A18
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Some new constructions for families of cospectral graphs are derived, and some old ones are considerably generalized. One of our new constructions is sufficiently powerful to produce an estimated 72% of the 51039 graphs on 9 vertices which do not have unique spectrum. In fact, the number of graphs of ordern without unique spectrum is believed to be at leastαn 3 g −1 for someα〉0, whereg n is the number of graphs of ordern andn ≥ 7.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02189621
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Connectivity of minimal Cayley graphs (1981)
    Springer
    Archiv der Mathematik 37 (1981), S. 473-476 
    Details
    ISSN: 1420-8938
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01234384
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    The chromatic connectivity of graphs (1988)
    Springer
    Graphs and combinatorics 4 (1988), S. 229-233 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A graphG ischromatically k-connected if every vertex cutset induces a subgraph with chromatic number at leastk. This concept arose in some work, involving the third author, on Ramsey Theory. (For the reference, see the text.) Here we begin the study of chromatic connectivity for its own sake. We show thatG is chromaticallyk-connected iff every homomorphic image of it isk-connected. IfG has no triangles then it is at most chromatically 1-connected, but we prove that the Kneser graphs provide examples ofK 4-free graphs with arbitrarily large chromatic connectivity. We also verify thatK 4-free planar graphs are at most chromatically 2-connected.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01864163
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Graphs with polynomial growth are covering graphs (1992)
    Springer
    Graphs and combinatorics 8 (1992), S. 233-241 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY 1,Y 2,... such thatX is a covering graph of each of these graphs and everyY k ,k≥2, is covering graph of the graphsY 1,...,Y k-1 . IfX is in additions-transitive for somes≥2 the graphsY i can be assumed to be at leasts-transitive.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02349960
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    facet.materialart.
    Unknown
    Combinatorics in Statistical Physics (1992)
    Details
    Publication Date: 2014-02-26
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...