LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES

Given a binary relation R of basis E ,wedefine its dual R *by R *(x,y )=R (y,x ).Arelation R is self-dual if it is isomorphic to R *. A binary relation R 0 is hemimorphic to R ,ifitisisomorphicto R or to R *. A binary relation R is d -half-reconstructible if it is determined by its restrictions of c...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	DAMMAK,JAMEL
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2003
Materias:	Relation de différenc Relation binaire Graphe Hy-pomorphe Hémimorphe Reconstruction Connexe
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172003000300002
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172003000300002
record_format	dspace
spelling	oai:scielo:S0716-091720030003000022004-03-03LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIESDAMMAK,JAMEL Relation de différenc Relation binaire Graphe Hy-pomorphe Hémimorphe Reconstruction Connexe Given a binary relation R of basis E ,wedefine its dual R by R (x,y )=R (y,x ).Arelation R is self-dual if it is isomorphic to R . A binary relation R 0 is hemimorphic to R ,ifitisisomorphicto R or to R . A binary relation R is d -half-reconstructible if it is determined by its restrictions of cardinality d , up to hemimorphism. In this paper we obtain : The finite connected binary relations of cardinality n =12 are (n -5)-half -reconstructibleinfo:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.22 n.3 20032003-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172003000300002en10.4067/S0716-09172003000300002
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Relation de différenc Relation binaire Graphe Hy-pomorphe Hémimorphe Reconstruction Connexe
spellingShingle	Relation de différenc Relation binaire Graphe Hy-pomorphe Hémimorphe Reconstruction Connexe DAMMAK,JAMEL LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES
description	Given a binary relation R of basis E ,wedefine its dual R by R (x,y )=R (y,x ).Arelation R is self-dual if it is isomorphic to R . A binary relation R 0 is hemimorphic to R ,ifitisisomorphicto R or to R . A binary relation R is d -half-reconstructible if it is determined by its restrictions of cardinality d , up to hemimorphism. In this paper we obtain : The finite connected binary relations of cardinality n =12 are (n -5)-half -reconstructible
author	DAMMAK,JAMEL
author_facet	DAMMAK,JAMEL
author_sort	DAMMAK,JAMEL
title	LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES
title_short	LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES
title_full	LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES
title_fullStr	LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES
title_full_unstemmed	LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES
title_sort	la (-5)-demi-reconstructibilitédes relations binaires connexes finies
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2003
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172003000300002
work_keys_str_mv	AT dammakjamel la5demireconstructibilitedesrelationsbinairesconnexesfinies
_version_	1718439732102299648

LA (-5)-DEMI-RECONSTRUCTIBILITÉDES RELATIONS BINAIRES CONNEXES FINIES

Ejemplares similares