نتایج جستجو برای: strongly

تعداد نتایج: 218515  

Journal: :Discrete Mathematics 2002
Frank Fiedler Mikhail H. Klin Mikhail E. Muzychuk

We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...

2017
GUNTER WEISS

In Euclidean geometry we find three types of special conics, which are distinguished with respect to the Euclidean similarity group: circles, parabolas, and equilateral hyperbolas. They have on one hand special elementary geometric properties (c.f. [7]) and on the other they are strongly connected to the “absolute elliptic involution” in the ideal line of the projectively enclosed Euclidean pla...

2000
Kenneth Clark Stephen Drinkwater

High rates of self-employment among ethnic minorities in England and Wales are investigated using a framework in which the self-employment decision is influenced by ethnic-specific attributes as well as sectoral earnings differentials. As expected, differences in an individual’s predicted earnings in paid and self-employment are strongly correlated with self-employment decisions. Individuals wi...

2005
Henk D.L. Hollmann Qing Xiang Jack van Lint

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. Hollmann, Association schemes, Master thesis, Eindhoven University of Technology, 1982]. It was further conjectured in [H.D.L. Hollmann, Association schemes, Master thesis, Eindhoven University of Technology, 1982] that the orbital ...

2003
Michael Drmota

In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way. With help of generating functions it is shown that there are only three types for the asymptotic behaviour of the random walk. It either converges to the stationary distribu...

Journal: :Australasian J. Combinatorics 2017
Susan G. Barwick Wen-Ai Jackson Tim Penttila

In this article we construct a series of new infinite families of strongly regular graphs with the same parameters as the point-graphs of non-singular quadrics in PG(n, 2). We study these graphs, describing and counting their maximal cliques, and determining their automorphism groups.

Journal: :Combinatorica 2009
Tamás Király Jácint Szabó

This note extends the results of Frank, Jordán, and Szigeti [1] on parity constrained orientations with connectivity requirements. Given a hypergraph H, a non-negative intersecting supermodular set function p, and a preferred in-degree parity for every node, a formula is given on the minimum number of nodes with wrong in-degree parity in an orientation of H covering p. It is shown that the mini...

2001
Peter A. Koen Gideon D. Markman Troy NY Robert A. Baron Richard Reilly

Previous research in corporate entrepreneurship found that selecting the right executive champion and requesting moderate initial funding was strongly correlated with start-up funding. Utilizing credible teams was found to be an important factor for projects receiving over $1,000,000. However, understanding the cognitive abilities of the individuals receiving funding was not assessed. We found ...

2017
Debby Damen Per van der Wijst Marije van Amelsvoort Emiel Krahmer

We investigated whether speakers’ referential communication benefits from an explicit focus on addressees’ perspective. Dyads took part in a referential communication game and were allocated to one of three experimental settings. Each of these settings elicited a different perspective mindset (none, selffocus, other-focus). In the two perspective settings, speakers were explicitly instructed to...

2006
Hiroyuki NAKASORA H. NAKASORA

Suppose that n is even and a set of n 2 − 1 mutually orthogonal Latin squares of order n exists. Then we can construct a strongly regular graph with parameters (n, n 2 (n−1), n 2 ( 2 −1), n 2 ( 2 −1)), which is called a Latin square graph. In this paper, we give a sufficient condition of the Latin square graph for the existence of a projective plane of order n. For the existence of a Latin squa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید