{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:26:12Z","timestamp":1760232372634,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T00:00:00Z","timestamp":1666828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861032","11961026","20202BABL201010"],"award-info":[{"award-number":["11861032","11961026","20202BABL201010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["11861032","11961026","20202BABL201010"],"award-info":[{"award-number":["11861032","11961026","20202BABL201010"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between the binary addresses in the graph is the Hamming distance. Due to the symmetry of the hypercube, one usually considers the graph embedded in the hypercube proportionally in distance, meaning that the l1-graphs. In this paper, we determine the l1-embeddability of hypertrees and unicyclic hypergraphs.<\/jats:p>","DOI":"10.3390\/sym14112260","type":"journal-article","created":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T22:36:17Z","timestamp":1666910177000},"page":"2260","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The l1-Embeddability of Hypertrees and Unicyclic Hypergraphs"],"prefix":"10.3390","volume":"14","author":[{"given":"Guangfu","family":"Wang","sequence":"first","affiliation":[{"name":"School of Science, East China Jiaotong University, Nanchang 330013, China"}]},{"given":"Lijun","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Science, East China Jiaotong University, Nanchang 330013, China"}]},{"given":"Zhikun","family":"Xiong","sequence":"additional","affiliation":[{"name":"School of Science, East China Jiaotong University, Nanchang 330013, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2256","DOI":"10.14778\/3407790.3407823","article-title":"Hypergraph motifs: Concepts, algorithms, and discoveries","volume":"13","author":"Lee","year":"2020","journal-title":"Proc. Vldb. Endow."},{"unstructured":"Berge, C. (1970). Graphes et Hypergraphes, Dunod. Monographes Universitaires de Math\u00e9mathiques.","key":"ref_2"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/qmath\/25.1.303","article-title":"On the two-colouring of hypergraphs","volume":"25","author":"Seymour","year":"1974","journal-title":"Q. J. Math."},{"unstructured":"Berge, C. (1989). Hypergraphs, Combinatorics of Finite Sets, North-Holland Publishing.","key":"ref_4"},{"key":"ref_5","first-page":"87","article-title":"On the spectral radii of k-uniform linear hypergraphs","volume":"41","author":"Tang","year":"2018","journal-title":"J. Nat. Sci. Hunan Norm. Univ."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10878-019-00473-3","article-title":"The wiener index of hypergraphs","volume":"39","author":"Liu","year":"2020","journal-title":"J. Comb. Optim."},{"key":"ref_7","first-page":"336","article-title":"Hypercycle systems","volume":"77","author":"Gionfriddo","year":"2020","journal-title":"Australas. J. Comb."},{"key":"ref_8","first-page":"197","article-title":"Espaces m\u00e9triques plongeables dans un hypercube: Aspects combinatoires, Ann","volume":"8","author":"Assouad","year":"1980","journal-title":"Discret. Math."},{"unstructured":"Assouad, P., and Deza, M. (1982). Metric Subspaces of L1, Universit\u00e9 de Paris-Sud, D\u00e9partement de Math\u00e9matique d\u2019Orsay.","key":"ref_9"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01586090","article-title":"Metrics and undirected cuts","volume":"32","author":"Karzanov","year":"1985","journal-title":"Math. Program."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/eujc.1993.1016","article-title":"On scale embeddings of graphs into hypercubes","volume":"14","author":"Shpectorov","year":"1993","journal-title":"Eur. J. Comb."},{"unstructured":"Berge, C. (1973). Graphs and Hypergraphs, North-Holland.","key":"ref_12"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(76)90070-8","article-title":"On hypergraphs without significant cycles","volume":"20","author":"Lewin","year":"1976","journal-title":"J. Comb. Theory Ser. B"},{"doi-asserted-by":"crossref","unstructured":"Bondy, J.A., and Murty, U.S.R. (1976). Graph Theory with Applications, Elsevier.","key":"ref_14","DOI":"10.1007\/978-1-349-03521-2"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S1571-0661(04)80985-X","article-title":"An efficient algorithm for helly property recognition in a linear hypergraph","volume":"46","author":"Bretto","year":"2001","journal-title":"Electron. Notes Theory Comput. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2115","DOI":"10.1016\/j.disc.2013.04.032","article-title":"l1-embeddability under the edge-gluing operation on graphs","volume":"313","author":"Wang","year":"2013","journal-title":"Discret. Math."},{"key":"ref_17","first-page":"305","article-title":"The l1-embeddability of trees, unicyclic graphs and their line graphs","volume":"50","author":"Li","year":"2020","journal-title":"Math. Pract. Theory"},{"unstructured":"Wang, G. (2017). l1-Embeddability of Graphs and Its Applications, Southeast University Press. (In Chinese).","key":"ref_18"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1016\/j.ejc.2008.09.008","article-title":"Polyhexes that are l1-graphs","volume":"30","author":"Deza","year":"2009","journal-title":"Eur. J. Comb."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(97)00066-8","article-title":"Clin d\u2019oeil on L1-embeddable planar graphs","volume":"80","author":"Chepoi","year":"1997","journal-title":"Discret. Appl. Math."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1006\/eujc.1999.0377","article-title":"Decomposition and l1-embedding of weakly median graphs","volume":"21","author":"Bandelt","year":"2000","journal-title":"Eur. J. Comb."},{"doi-asserted-by":"crossref","unstructured":"Deza, M., Grishukhin, V., and Shtogrin, M. (2004). Scale-Isometric Polytopal Graphs in Hypercubes and Cubic Lattices, Imperial College Press.","key":"ref_22","DOI":"10.1142\/9781860945489"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1022441506632","article-title":"l1-rigid graphs","volume":"2","author":"Deza","year":"1994","journal-title":"J. Algebr. Comb."},{"key":"ref_24","first-page":"318","article-title":"On felicitous character of generalized sun-graphs","volume":"35","author":"Yang","year":"2015","journal-title":"Int. J. Math."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.2991\/ijcis.d.200730.002","article-title":"Cubic graphs and their application to a traffic flow problem","volume":"13","author":"Muhiuddin","year":"2020","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2412012","DOI":"10.1155\/2022\/2412012","article-title":"A Novel Description of Some Concepts in Interval-Valued Intuitionistic Fuzzy Graph with an Application","volume":"2022","author":"Qiang","year":"2022","journal-title":"Adv. Math. Phys."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BFb0111212","article-title":"Topological indices for structure-activity correlations","volume":"114","author":"Balaban","year":"1983","journal-title":"Top. Curr. Chem."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1021\/ja01193a005","article-title":"Structural determination of paraffin boiling points","volume":"69","author":"Wiener","year":"1947","journal-title":"J. Am. Chem. Soc."},{"unstructured":"Imrich, W., and Klav\u017ear, S. (2000). Product Graphs: Structure and Recognition, John Wiley & Sons.","key":"ref_29"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/11\/2260\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:04:02Z","timestamp":1760144642000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/11\/2260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,27]]},"references-count":29,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["sym14112260"],"URL":"https:\/\/doi.org\/10.3390\/sym14112260","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,10,27]]}}}