Results 101 to 110 of about 568,566 (214)

Chromatic polynomials of random graphs

, 2010
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very ...
Ehrlich, Christoph, Timme, Marc, van Bussel, F., van Bussel, Frank, Fliegner, Denny, Stolzenberg, Sebastian, Fliegner, D., Ehrlich, C., Timme, M., Stolzenberg, S.   +9 more
core   +1 more source

A Note on a Broken-Cycle Theorem for Hypergraphs

Discussiones Mathematicae Graph Theory, 2014
Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets.
Trinks Martin
doaj   +1 more source

Mechanistic Insights Into Color and Texture Stability of Frozen Tropical Vegetables: Processing, Modeling, and Preservation Strategies

Food Science &Nutrition, Volume 14, Issue 6, June 2026.
This review elucidates the mechanistic pathways governing color and texture degradation in frozen tropical vegetables, emphasizing pigment oxidation, enzymatic softening, and ice crystal‐induced structural damage. It integrates kinetic, Arrhenius, RSM, and machine‐learning models with advanced preservation strategies to optimize freezing processes ...
Muhammad Muntasir Mahmud, Md. Suhel Mia, Md. Hassan Bin Nabi, Abid Hassan Arnab, Wahidu Zzaman   +4 more
wiley   +1 more source

Chromatic roots are dense in the whole complex plane

, 2004
I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l.
Sokal, AD
core  

A Survey of Maximal k-Degenerate Graphs and k-Trees

Theory and Applications of Graphs
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj   +1 more source

Roots of chromatic polynomials

Discrete Mathematics, 2001
The chromatic polynomial \(P(G,\lambda)\) of a graph \(G\) with chromatic number \(\chi\) has a root with modulus at least \([m- ({\chi\over 2})]/(n- \chi)\), where \(n (m)\) is the number of vertices (edges) of \(G\). This bound is proved to be best possible for \((\chi-1)\)-trees only.
openaire   +1 more source

Freeze‐Drying Chlorella vulgaris by Using Aquafaba, Deactivated Yeast, Inulin and Maltodextrin

Food Science &Nutrition, Volume 14, Issue 6, June 2026.
This study investigates the freeze‐drying efficiency of Chlorella vulgaris cultivated in a photobioreactor, utilizing novel and traditional carrier agents including aquafaba, deactivated yeast, inulin, and maltodextrin. The findings highlight the comparative effects of these matrices on the structural integrity and physical properties of the microalgae
Faruk Tamtürk, Başak Gürbüz, Sevim Dalabasmaz, Yaşar Durmaz, Nevzat Konar, Ömer Said Toker, Atefeh Karimidastjerd   +6 more
wiley   +1 more source

Bounds on the complex zeros of (Di)Chromatic polynomials and Potts-model partition functions

, 2001
We show that there exist universal constants C(r) such that, for all loopless graphs G of maximum degree less than or equal to r, the zeros (real or complex) of the chromatic polynomial P-G(q) lie in the disc \q\ 7.963907r.
Sokal, AD
core  

Reduced Hypotonic Exposure and Sequential Membrane Cholesterol Enrichment Limit Phosphatidylserine Externalization and Enhance Circulatory Retention of Erythrocyte‐Derived Microparticles

Journal of Biomedical Materials Research Part A, Volume 114, Issue 6, June 2026.
ABSTRACT Erythrocyte‐derived carriers have emerged as effective biomimetic platforms for the delivery of therapeutic and imaging cargos. However, clearance by the mononuclear phagocytic system (MPS) limits their utility. Towards development of standardized methods for increased bioavailability, we have developed an approach that lowers the ...
Shamima Zaman, Grant Swajian, Shiril Bhardwaj Iragavarapu, Md Tashdid Hossain Shoudho, Bahman Anvari   +4 more
wiley   +1 more source

Hypercontractive inequalities via SOS, and the Frankl-Rödl graph

Discrete Analysis, 2016
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph, Discrete Analysis 2016:4, 20 pp. One of the major unsolved problems in theoretical computer science is the unique games conjecture of Subhash Khot. Its importance lies in the fact that it
Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou   +3 more
doaj   +1 more source