scholarly journals On the symmetric difference of sets as a group operation

1948 ◽  
Vol 1 (3) ◽  
pp. 203-205 ◽  
Author(s):  
Henry Helson
1953 ◽  
Vol 5 ◽  
pp. 324-331 ◽  
Author(s):  
J. G. Elliott

The fact that the symmetric difference is a group operation in a Boolean algebra is, of course, well known. Not so well known is the fact observed by Ellis [3] that it possesses some of the desirable properties of a metric distance function. Specifically, if * denotes this operation, it is easy to verify that


Author(s):  
Chen Zhang ◽  
Huakang Bian ◽  
Kenta Yamanaka ◽  
Akihiko Chiba
Keyword(s):  

1974 ◽  
Vol 18 (4) ◽  
pp. 450-452 ◽  
Author(s):  
Charles H. C. Little

In this paper, we consider factor covered graphs, which are defined basically as connected graphs in which every edge belongs to a 1-factor. The main theorem is that for any two edges e and e′ of a factor covered graph, there is a cycle C passing through e and e′ such that the edge set of C is the symmetric difference of two 1-factors.


2021 ◽  
Vol 10 (4) ◽  
pp. 2045-2052
Author(s):  
S. Menaka ◽  
R.S. Manikandan ◽  
R. Muruganandam

Sign in / Sign up

Export Citation Format

Share Document