Výsledky vyhledávání - "William L. Kocay"

Autor: Giulia Palma, Andrea Frosini, William L. Kocay, Lama Tarsissi

Publikováno v: Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, In press, ⟨10.1016/j.dam.2020.10.020⟩

Given a 3-uniform hypergraph H consisting of a set V of vertices, and T ⊆ V 3 triples, a null labelling is an assignment of ± 1 to the triples such that each vertex is contained in an equal number of triples labelled + 1 and − 1 . Thus, the sign

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eed82c2972477c41b7dbfa15623aeb2
https://doi.org/10.1016/j.dam.2020.10.020

Zobrazit plný text záznamu

Properties of Unique Degree Sequences of 3-Uniform Hypergraphs

Autor: William L. Kocay, Michela Ascolese, Andrea Frosini, Lama Tarsissi

Publikováno v: Discrete Geometry and mathematica
Discrete Geometry and mathematica, pp.312-324, 2021, ⟨10.1007/978-3-030-76657-3_22⟩
Lecture Notes in Computer Science ISBN: 9783030766566
DGMM

In 2018 Deza et al. proved the NP-completeness of deciding wether there exists a 3-uniform hypergraph compatible with a given degree sequence. A well known result of Erdos and Gallai (1960) shows that the same problem related to graphs can be solved

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aeb1b6b7866fc63cee450d7d28db3e7f
https://hal.archives-ouvertes.fr/hal-03232982

Zobrazit plný text záznamu

A Study on the Existence of Null Labelling for 3-Hypergraphs

Autor: Andrea Frosini, Niccolò Di Marco, William L. Kocay

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030799861
IWOCA

A 3-uniform hypergraph H consists of a set V of vertices, and \(E\subseteq {V\atopwithdelims ()3}\) triples. Let a null labelling be an assignment of \(\pm 1\) to the triples such that each vertex has signed degree equal to zero. Assumed as necessary

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::809dc81dba360e0ac4b4fdb9b757fbf9
http://hdl.handle.net/2158/1242518

Zobrazit plný text záznamu

Coordinatizing n_3 configurations

Autor: William L. Kocay

Publikováno v: Ars Mathematica Contemporanea. 15:127-145

Given an n 3 configuration, a one-point extension is a technique that constructs ( n + 1) 3 configurations from it. A configuration is geometric if it can be realized by a collection of points and straight lines in the plane. Given a geometric n 3 co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a6d5148d40f6e2d28c80cb79bfcdf5d1
https://doi.org/10.26493/1855-3974.1059.4be

Zobrazit plný text záznamu

The configurations (13_3)

Autor: William L. Kocay

Publikováno v: The Art of Discrete and Applied Mathematics. 4:#P3.15

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::943e47e267ec45f47f70d5de8fdc8444
https://doi.org/10.26493/2590-9770.1327.9ea

Zobrazit plný text záznamu

Intersection Preserving Mappings

Autor: William L. Kocay, Yangsheng Zou

Publikováno v: Graphs and Combinatorics. 33:1081-1087

The intersection preserving mapping problem was introduced by Czimmermann in his research on isomorphism of hypergraphs. This paper explores the condition when an intersection preserving mapping is not induced by any bijection. A new characterization

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0357e0e08b955faa5718e7f7b9602651
https://doi.org/10.1007/s00373-017-1795-2

Zobrazit plný text záznamu

One-point extensions in n_3 configurations

Autor: William L. Kocay

Publikováno v: Ars Mathematica Contemporanea. 10:291-322

Given an n 3 configuration, a 1-point extension is a technique that constructs an ( n + 1) 3 configuration from it. It is proved that all ( n + 1) 3 configurations can be constructed from an n 3 configuration using a 1-point extension, except for the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ee587242b0e1c659f7a7c5e2982e9574
https://doi.org/10.26493/1855-3974.758.bec

Zobrazit plný text záznamu

A Note on Non-reconstructible 3-Hypergraphs

Autor: William L. Kocay

Publikováno v: Graphs and Combinatorics. 32:1945-1963

Non-reconstructible 3-hypergraphs are studied. A number of counting lemmas are proved for the subgraphs and sub-hypergraphs of a 3-hypergraph. A computer search is used to find all non-reconstructible 3-hypergraphs on at most 8 vertices and 11 triple

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5c08f2d6b9e138dcc3cdbddd4b5daec3
https://doi.org/10.1007/s00373-015-1671-x

Zobrazit plný text záznamu

On k-edge-magic labelings of maximal outerplanar graphs

Autor: Saeid Alikhani, William L. Kocay, Sin-Min Lee, Gee-Choon Lau

Publikováno v: AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 1, Pp 40-46 (2015)

Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the l

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8550d93de45818faa918442c5002b676
http://www.sciencedirect.com/science/article/pii/S0972860015000079

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání