Let G be a simple graph of order $$n\ge 2$$ and let $$k\in \{1,\ldots ,n-1\}$$ . The k-token $$F_k(G)$$ is the whose vertices are k-subsets V(G), where two adjacent in whenever their symmetric difference an edge G. In 2018 Leaños Trujillo-Negrete proved that if t-connected $$t\ge k$$ , then at least $$k(t-k+1)$$ -connected. this paper we show such lower bound remains true context edge-connectiv...

Despite calls for regulation in the crypto utility token market, it is unclear how investors value current regulatory proposals. We find that on average, react negatively to news increases likelihood of securities and transparency-related regulation. also this negative reaction attenuated tokens rated higher quality transparency by intermediaries, those have levels disclosure, listed more liqui...

Examines all the hype about profile picture (PFP) NFTs

All versions of the General Motors Manufacturing Automation Protocol (GM MAP) specify that MAP’S lower layer services are to be provided by the IEEE 802.4 token bus. An understanding of 802.4 and its performance aspects is therefore prerequisite to predicting the performance of MAP. We show how total bus capacity is divided among data throughput, token traffic, and propagation delays. We show t...

Reified theories have been used widely in knowledge representation. From an ontological perspective, reification involve populating the ontology with event or property types and tokens. While type reification has been used in many works, it has been criticized as being philosophically unsound, and token reification has been advocated in its place by Galton. In this paper, we take the position o...