Journal article
On equicut graphs
- Abstract:
-
The size sz(G) of an l_1-graph G=(V,E) is the minimum of n_f/t_f over all its possible l_1-embeddings f into n_f-dimensional hypercube with scale t_f. In terms of v=|V|, the sum of distances between all the pairs of vertices of G is at most sz(G) v^2/4 for v even, (resp. sz(G)(v-1)(v+1)/4 for v odd). This bound is reached if and only if G is an equicut graph, that is, G admits an l_1-embedding with column sums v/2, v even (resp. (v-1)/2 for v odd). Basic properties of equicut graphs are inv...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Author's original, pdf, 193.0KB)
-
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Taylor and Francis Publisher's website
- Journal:
- Multiple Valued Logic: An International Journal
- Volume:
- 7
- Pages:
- 363–377
- Publication date:
- 2001-01-01
- ISSN:
-
1023-6627
- Source identifiers:
-
446351
Item Description
- Keywords:
- Pubs id:
-
pubs:446351
- UUID:
-
uuid:f619d170-0c01-4127-80cd-98067925b4ff
- Local pid:
- info:fedora/pubs:446351
- Deposit date:
- 2016-07-28
Terms of use
- Copyright holder:
- Taylor & Francis Ltd
- Copyright date:
- 2001
- Notes:
-
This is a
pre-print version of a journal article published by Taylor & Francis in Multiple Valued Logic: An International Journal in 2001
If you are the owner of this record, you can report an update to it here: Report update to this record