The structures of bad words
The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest in...
Ausführliche Beschreibung
Autor*in: |
Wei, Jianxin [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2017transfer abstract |
---|
Umfang: |
11 |
---|
Übergeordnetes Werk: |
Enthalten in: Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells - Wang, Qiang ELSEVIER, 2015transfer abstract, London |
---|---|
Übergeordnetes Werk: |
volume:59 ; year:2017 ; pages:204-214 ; extent:11 |
Links: |
---|
DOI / URN: |
10.1016/j.ejc.2016.05.003 |
---|
Katalog-ID: |
ELV035799137 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | ELV035799137 | ||
003 | DE-627 | ||
005 | 20230625205619.0 | ||
007 | cr uuu---uuuuu | ||
008 | 180603s2017 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.ejc.2016.05.003 |2 doi | |
028 | 5 | 2 | |a GBVA2017007000029.pica |
035 | |a (DE-627)ELV035799137 | ||
035 | |a (ELSEVIER)S0195-6698(16)30022-1 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | |a 510 | |
082 | 0 | 4 | |a 510 |q DE-600 |
082 | 0 | 4 | |a 660 |q VZ |
082 | 0 | 4 | |a 620 |q VZ |
082 | 0 | 4 | |a 610 |q VZ |
084 | |a 44.94 |2 bkl | ||
100 | 1 | |a Wei, Jianxin |e verfasserin |4 aut | |
245 | 1 | 4 | |a The structures of bad words |
264 | 1 | |c 2017transfer abstract | |
300 | |a 11 | ||
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a nicht spezifiziert |b z |2 rdamedia | ||
338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
520 | |a The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . | ||
520 | |a The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . | ||
773 | 0 | 8 | |i Enthalten in |n Academic Press |a Wang, Qiang ELSEVIER |t Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells |d 2015transfer abstract |g London |w (DE-627)ELV013014358 |
773 | 1 | 8 | |g volume:59 |g year:2017 |g pages:204-214 |g extent:11 |
856 | 4 | 0 | |u https://doi.org/10.1016/j.ejc.2016.05.003 |3 Volltext |
912 | |a GBV_USEFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SYSFLAG_U | ||
912 | |a SSG-OLC-PHA | ||
912 | |a GBV_ILN_40 | ||
936 | b | k | |a 44.94 |j Hals-Nasen-Ohrenheilkunde |q VZ |
951 | |a AR | ||
952 | |d 59 |j 2017 |h 204-214 |g 11 | ||
953 | |2 045F |a 510 |
author_variant |
j w jw |
---|---|
matchkey_str |
weijianxin:2017----:hsrcueo |
hierarchy_sort_str |
2017transfer abstract |
bklnumber |
44.94 |
publishDate |
2017 |
allfields |
10.1016/j.ejc.2016.05.003 doi GBVA2017007000029.pica (DE-627)ELV035799137 (ELSEVIER)S0195-6698(16)30022-1 DE-627 ger DE-627 rakwb eng 510 510 DE-600 660 VZ 620 VZ 610 VZ 44.94 bkl Wei, Jianxin verfasserin aut The structures of bad words 2017transfer abstract 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . Enthalten in Academic Press Wang, Qiang ELSEVIER Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells 2015transfer abstract London (DE-627)ELV013014358 volume:59 year:2017 pages:204-214 extent:11 https://doi.org/10.1016/j.ejc.2016.05.003 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.94 Hals-Nasen-Ohrenheilkunde VZ AR 59 2017 204-214 11 045F 510 |
spelling |
10.1016/j.ejc.2016.05.003 doi GBVA2017007000029.pica (DE-627)ELV035799137 (ELSEVIER)S0195-6698(16)30022-1 DE-627 ger DE-627 rakwb eng 510 510 DE-600 660 VZ 620 VZ 610 VZ 44.94 bkl Wei, Jianxin verfasserin aut The structures of bad words 2017transfer abstract 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . Enthalten in Academic Press Wang, Qiang ELSEVIER Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells 2015transfer abstract London (DE-627)ELV013014358 volume:59 year:2017 pages:204-214 extent:11 https://doi.org/10.1016/j.ejc.2016.05.003 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.94 Hals-Nasen-Ohrenheilkunde VZ AR 59 2017 204-214 11 045F 510 |
allfields_unstemmed |
10.1016/j.ejc.2016.05.003 doi GBVA2017007000029.pica (DE-627)ELV035799137 (ELSEVIER)S0195-6698(16)30022-1 DE-627 ger DE-627 rakwb eng 510 510 DE-600 660 VZ 620 VZ 610 VZ 44.94 bkl Wei, Jianxin verfasserin aut The structures of bad words 2017transfer abstract 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . Enthalten in Academic Press Wang, Qiang ELSEVIER Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells 2015transfer abstract London (DE-627)ELV013014358 volume:59 year:2017 pages:204-214 extent:11 https://doi.org/10.1016/j.ejc.2016.05.003 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.94 Hals-Nasen-Ohrenheilkunde VZ AR 59 2017 204-214 11 045F 510 |
allfieldsGer |
10.1016/j.ejc.2016.05.003 doi GBVA2017007000029.pica (DE-627)ELV035799137 (ELSEVIER)S0195-6698(16)30022-1 DE-627 ger DE-627 rakwb eng 510 510 DE-600 660 VZ 620 VZ 610 VZ 44.94 bkl Wei, Jianxin verfasserin aut The structures of bad words 2017transfer abstract 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . Enthalten in Academic Press Wang, Qiang ELSEVIER Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells 2015transfer abstract London (DE-627)ELV013014358 volume:59 year:2017 pages:204-214 extent:11 https://doi.org/10.1016/j.ejc.2016.05.003 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.94 Hals-Nasen-Ohrenheilkunde VZ AR 59 2017 204-214 11 045F 510 |
allfieldsSound |
10.1016/j.ejc.2016.05.003 doi GBVA2017007000029.pica (DE-627)ELV035799137 (ELSEVIER)S0195-6698(16)30022-1 DE-627 ger DE-627 rakwb eng 510 510 DE-600 660 VZ 620 VZ 610 VZ 44.94 bkl Wei, Jianxin verfasserin aut The structures of bad words 2017transfer abstract 11 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . Enthalten in Academic Press Wang, Qiang ELSEVIER Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells 2015transfer abstract London (DE-627)ELV013014358 volume:59 year:2017 pages:204-214 extent:11 https://doi.org/10.1016/j.ejc.2016.05.003 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.94 Hals-Nasen-Ohrenheilkunde VZ AR 59 2017 204-214 11 045F 510 |
language |
English |
source |
Enthalten in Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells London volume:59 year:2017 pages:204-214 extent:11 |
sourceStr |
Enthalten in Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells London volume:59 year:2017 pages:204-214 extent:11 |
format_phy_str_mv |
Article |
bklname |
Hals-Nasen-Ohrenheilkunde |
institution |
findex.gbv.de |
dewey-raw |
510 |
isfreeaccess_bool |
false |
container_title |
Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells |
authorswithroles_txt_mv |
Wei, Jianxin @@aut@@ |
publishDateDaySort_date |
2017-01-01T00:00:00Z |
hierarchy_top_id |
ELV013014358 |
dewey-sort |
3510 |
id |
ELV035799137 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV035799137</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625205619.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ejc.2016.05.003</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2017007000029.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV035799137</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0195-6698(16)30022-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.94</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wei, Jianxin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The structures of bad words</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) .</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) .</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Academic Press</subfield><subfield code="a">Wang, Qiang ELSEVIER</subfield><subfield code="t">Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="g">London</subfield><subfield code="w">(DE-627)ELV013014358</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:59</subfield><subfield code="g">year:2017</subfield><subfield code="g">pages:204-214</subfield><subfield code="g">extent:11</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.ejc.2016.05.003</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.94</subfield><subfield code="j">Hals-Nasen-Ohrenheilkunde</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">59</subfield><subfield code="j">2017</subfield><subfield code="h">204-214</subfield><subfield code="g">11</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
author |
Wei, Jianxin |
spellingShingle |
Wei, Jianxin ddc 510 ddc 660 ddc 620 ddc 610 bkl 44.94 The structures of bad words |
authorStr |
Wei, Jianxin |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013014358 |
format |
electronic Article |
dewey-ones |
510 - Mathematics 660 - Chemical engineering 620 - Engineering & allied operations 610 - Medicine & health |
delete_txt_mv |
keep |
author_role |
aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
topic_title |
510 510 DE-600 660 VZ 620 VZ 610 VZ 44.94 bkl The structures of bad words |
topic |
ddc 510 ddc 660 ddc 620 ddc 610 bkl 44.94 |
topic_unstemmed |
ddc 510 ddc 660 ddc 620 ddc 610 bkl 44.94 |
topic_browse |
ddc 510 ddc 660 ddc 620 ddc 610 bkl 44.94 |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
zu |
hierarchy_parent_title |
Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells |
hierarchy_parent_id |
ELV013014358 |
dewey-tens |
510 - Mathematics 660 - Chemical engineering 620 - Engineering 610 - Medicine & health |
hierarchy_top_title |
Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)ELV013014358 |
title |
The structures of bad words |
ctrlnum |
(DE-627)ELV035799137 (ELSEVIER)S0195-6698(16)30022-1 |
title_full |
The structures of bad words |
author_sort |
Wei, Jianxin |
journal |
Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells |
journalStr |
Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
500 - Science 600 - Technology |
recordtype |
marc |
publishDateSort |
2017 |
contenttype_str_mv |
zzz |
container_start_page |
204 |
author_browse |
Wei, Jianxin |
container_volume |
59 |
physical |
11 |
class |
510 510 DE-600 660 VZ 620 VZ 610 VZ 44.94 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Wei, Jianxin |
doi_str_mv |
10.1016/j.ejc.2016.05.003 |
dewey-full |
510 660 620 610 |
title_sort |
structures of bad words |
title_auth |
The structures of bad words |
abstract |
The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . |
abstractGer |
The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . |
abstract_unstemmed |
The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) . |
collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 |
title_short |
The structures of bad words |
url |
https://doi.org/10.1016/j.ejc.2016.05.003 |
remote_bool |
true |
ppnlink |
ELV013014358 |
mediatype_str_mv |
z |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.ejc.2016.05.003 |
up_date |
2024-07-06T18:30:10.945Z |
_version_ |
1803855447662264320 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV035799137</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625205619.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ejc.2016.05.003</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2017007000029.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV035799137</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0195-6698(16)30022-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.94</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wei, Jianxin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The structures of bad words</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) .</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The generalized Fibonacci cube Q d ( f ) is the graph obtained from the hypercube Q d by removing all vertices that contain a given binary word f . A word f is called good if Q d ( f ) is an isometric subgraph of Q d for all d ≥ 1 , and bad otherwise. The index B ( f ) of a word f is the smallest integer d such that Q d ( f ) is not an isometric subgraph of Q d . Klavžar and Shpectorov showed that a bad word has a 2-error overlap. In this paper, we show that if a word has a 2-error overlap then it is bad, and we characterize the structures of all bad words. Ilić, Klavžar and Rho showed that a word f is bad if there exist p -critical words for Q d ( f ) for some d . We find that a word is bad if and only if there exists only a pair of 2-critical words, or only a pair of 3-critical words, or both only a pair of 2-critical words and only a pair of 3-critical words for Q B ( f ) ( f ) . We also design an O ( | f | 3 ) algorithm which can output the index B ( f ) of f , and give all pairs of p -critical words for Q B ( f ) ( f ) .</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Academic Press</subfield><subfield code="a">Wang, Qiang ELSEVIER</subfield><subfield code="t">Assessment of five different cathode materials for Co(II) reduction with simultaneous hydrogen evolution in microbial electrolysis cells</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="g">London</subfield><subfield code="w">(DE-627)ELV013014358</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:59</subfield><subfield code="g">year:2017</subfield><subfield code="g">pages:204-214</subfield><subfield code="g">extent:11</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.ejc.2016.05.003</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.94</subfield><subfield code="j">Hals-Nasen-Ohrenheilkunde</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">59</subfield><subfield code="j">2017</subfield><subfield code="h">204-214</subfield><subfield code="g">11</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
score |
7.4001417 |