Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c ≥ 2, there are at most finitely many trunks of semiharmonic graphs with cyclomatic number c — in contrast to the fact established by the last two of the present authors in their paper Semiharmonic Bicyclic Graphs (this journal) that there are infinitely many connected semiharmonic gr...

Quantum contextuality is one of the most recognized resources in quantum communication and computing scenarios. We provide a new quantifier this resource, rank (RC). define RC as minimum number non-contextual behaviors that are needed to simulate contextual behavior. show logarithm natural measure satisfying several properties considered spirit resource-theoretic approach. The include faithfuln...

In this study‎, ‎a new polynomial rank transmutation is proposed with the help of‎ ‎ the idea of quadratic rank transmutation mapping (QRTM)‎. ‎This polynomial rank‎ ‎ transmutation is allowed to extend the range of the transmutation parameter from‎ ‎  [-1,1] to [-1,k]‎‎. ‎At this point‎, ‎the generated distributions gain more&lrm...

There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...