Results 61 to 70 of about 110,794 (282)
Problems on chromatic polynomials of hypergraphs
Electronic Journal of Graph Theory and Applications, 2020 Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural extension of chromatic polynomial of a graph. It also has been studied for more than 30 years.
Ruixue Zhang, Fengming Dong
doaj +1 more source
Chromatic Polynomials of Oriented Graphs
The Electronic Journal of Combinatorics, 2019 The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph, closing an open problem posed by Sopena.
Cox, Danielle, Duffy, Christopher
openaire +4 more sources
Cardiac‐Derived ECM Microspheres for Enhanced hiPSC‐CMs Maturation
Advanced Functional Materials, EarlyView.Cardiac extracellular matrix microspheres derived from decellularized porcine heart provide a biomimetic 3D microenvironment for human induced pluripotent stem cell–derived cardiomyocytes (hiPSC‐CMs). This platform supports short‐ and long‐term culture, enhances structural organization, and promotes electrophysiological and functional maturation of ...
Jiazhu Xu +9 more
wiley +1 more source
Explicit formulas for chromatic polynomials of some series-parallel graphs
Учёные записки Казанского университета: Серия Физико-математические науки, 2018 The main goal of our paper is to present explicit formulas for chromatic polynomials of some planar series-parallel graphs (sp-graphs). The necklace-graph considered in this paper is the simplest non-trivial sp-graph.
E.Yu. Lerner, S.A. Mukhamedjanova
doaj
Zagreb Polynomials of Certain Families of Dendrimer Nanostars
Tikrit Journal of Pure Science, 2023 Let G be a simple connected graph with vertex set V(G) and edge set E(G). The first, second and third Zagreb polynomials of G are defined as , and A dendrimer is an artificially manufactured or synthesized molecule built up from branched units ...
Nabeel E. Arif
doaj +1 more source
, 2018 We study the time complexity of induced subgraph isomorphism problems where the pattern graph is fixed. The earliest known example of an improvement over trivial algorithms is by Itai and Rodeh (1978) who sped up triangle detection in graphs using fast matrix multiplication.
Bläser, Markus +2 more
openaire +4 more sources
Advanced Healthcare Materials, EarlyView.A two‐phase workflow (OFAT screening followed by central composite design) maps how processing variables tune PFCE‐PLGA nanoparticle size, dispersity, surface charge, loading, and 19F‐MRI signal. In situ, time‐resolved synchrotron SAXS tracks albumin‐corona growth on intact dispersions and reveals PFCE‐dependent adsorption pathways.
Joice Maria Joseph +11 more
wiley +1 more source
Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices
AxiomsGraph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs.
Tingzeng Wu, Yinggang Bai, Shoujun Xu
doaj +1 more source
Structural differentiation of graphs using Hosoya-based indices. [PDF]
PLoS ONE, 2014 In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a graph. The first measure combines structural information captured by partial Hosoya polynomials and graph spectra. The latter is a graph entropy measure which
Matthias Dehmer +2 more
doaj +1 more source
On Motives Associated to Graph Polynomials
, 2005 The appearance of multiple zeta values in anomalous dimensions and $\beta$-functions of renormalizable quantum field theories has given evidence towards a motivic interpretation of these renormalization group functions. In this paper we start to hunt the
A. Borel +12 more
core +1 more source