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

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

Journal: :Des. Codes Cryptography 2016
Claude Carlet Guang Gong Yin Tan

Let F be a function from Fpn to itself and δ a positive integer. F is called zerodifference δ-balanced if the equation F (x+a)−F (x) = 0 has exactly δ solutions for all nonzero a ∈ Fpn . As a particular case, all known quadratic planar functions are zero-difference 1-balanced; and some quadratic APN functions over F2n are zerodifference 2-balanced. In this paper, we study the relationship betwe...

Journal: :Eur. J. Comb. 2014
S. Mirvakili Bijan Davvaz Violeta Leoreanu Fotea

In the theory of hyperrings, fundamental relations make a connection between hyperrings and ordinary rings. Commutative fundamental rings and the fundamental relation α which is the smallest strongly regular relation in hyperringswere introduced by Davvaz and Vougiouklis (2007). Recently, another strongly regular relation named θ on hyperrings has been studied by Ameri and Norouzi (2013). Ameri...

2004
Andreas Paffenholz Günter M. Ziegler

We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not always specialize to convex polytopes; however, in a number of cases where we can realize it, it produces interesting classes of polytopes. Thus we produce ...

Journal: :Des. Codes Cryptography 1999
Willem H. Haemers René Peeters Jeroen M. van Rijckevorsel

For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular graphs on fewer than 45 vertices.

2017
Yuxiang He Yu Zhang Robert Cifelli David Kitzmiller

This paper presents a new and enhanced fusion module for the Multi-Sensor Precipitation Estimator (MPE) that would objectively blend real-time satellite quantitative precipitation estimates (SQPE) with radar and gauge estimates. This module consists of a preprocessor that mitigates systematic bias in SQPE, and a two-way blending routine that statistically fuses adjusted SQPE with radar estimate...

2009
S. M. Anvariyeh B. Davvaz

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to da...

Journal: :CoRR 2012
Kenza Bouaroudj Ilham Kitouni Hiba Hachichi Djamel-Eddine Saïdouni

Testing is a validation activity used to check the system’s correctness with respect to the specification. In this context, test based on refusals is studied in theory and tools are effectively constructed. This paper addresses, a formal testing based on stochastic refusals graphs (SRG) in order to test stochastic system represented by maximality-based stochastic labeled transition systems (MSL...

Journal: :Electronic Notes in Discrete Mathematics 2001
Peter J. Cameron

Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6). (The first assertion is a special case of a theorem of Shrikhande, while the second is the result of a computer search by McKay and Spence.) In the light of th...

2006
Joohyung Kim Clifford Bergman Fritz Keinert Jonathan D. H. Smith

We explore twoor 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. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several specific classification problems. We work with s...

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

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