{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:45Z","timestamp":1753893825586,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>\u00a0 For a graph $G$ and a positive integer $n$, the $n$th cone over $G$ is obtained from the direct product $G \\times P_n$ of $G$ and a path $P_n=(0,1,\\ldots, n)$, by adding a copy of $G$ on $V(G) \\times \\{0\\}$, and identifying $V(G) \\times \\{n\\}$ into a single vertex $\\star$. Assume $G$ and $H$ are graphs, and $h: V(H) \\to \\mathbb{N}$ is a mapping which assigns to each vertex $v$ of $H$ a positive integer. For each vertex $v$ of $H$, let $\\Delta_{h(v)}(G,v)$ be a copy of the $h(v)$-th cone over $G$, with vertex set $V(\\Delta_{h(v)}(G)) \\times \\{v\\}$. The $(H,h)$-cone over $G$ is the graph obtained from the disjoint union of $\\{\\Delta_{h(v)}(G, v) : v\\in V(H)\\}$ by identifying $\\{((x,0),v): v \\in V(H)\\}$ into a single vertex $(x,0)$ for each $x \\in V(G)$, and adding edges $\\{(\\star, v) (\\star, v'): vv' \\in E(H)\\}$. When $h(v)=n$ is a constant mapping, then $\\Delta_{H,h}(G)$ is denoted by $\\Delta_{H,n}(G)$. In this paper, we determines the fractional chromatic number of $\\Delta_{H,n}(G)$ for all $G, H$ with $\\chi_f(H)\\le \\chi_f(G)$.<\/jats:p>","DOI":"10.37236\/10181","type":"journal-article","created":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T08:40:32Z","timestamp":1649407232000},"source":"Crossref","is-referenced-by-count":0,"title":["The Fractional Chromatic Number of Generalized Cones over Graphs"],"prefix":"10.37236","volume":"29","author":[{"given":"Jialu","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2022,4,1]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i2p7\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i2p7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T08:40:33Z","timestamp":1649407233000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i2p7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,4,8]]}},"URL":"https:\/\/doi.org\/10.37236\/10181","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2022,4,1]]},"article-number":"P2.7"}}