250 search results - page 3 / 50 » Constructing a Class of Symmetric Graphs |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
CAI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
DM
2002
13 years 8 months ago
2002
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
HICSS
2005
IEEE
14 years 2 months ago
2005
IEEE
ARSCOM
2007
13 years 8 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...