Results 41 to 50 of about 26,192 (266)
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Archives of Control Sciences, 2015 In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectrum ...
Furmańczyk Hanna, Kubale Marek
doaj +1 more source
Detection number of bipartite graphs and cubic graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 For a connected graph G of order |V(G)| ≥3 and a k-labelling c : E(G) →{1,2,…,k} of the edges of G, the code of a vertex v of G is the ordered k-tuple (ℓ1,ℓ2,…,ℓk), where ℓi is the number of edges incident with v that are labelled i. The k-labelling c is
Frederic Havet +2 more
doaj +1 more source
Cubical graphs and cubical dimensions
Computers & Mathematics with Applications, 1988 A cubical graph G is isomorphic to a subgraph of some hypercube \(Q_ n\). The cubical dimension cd(G) is the smallest such n. The induced cubical dimension icd(G) is the minimum n for which G is an induced subgraph of \(Q_ n\). The determination for a given cubical graph G of the exact values of cd(G) and icd(G) is very difficult.
openaire +1 more source
Advanced Functional Materials, EarlyView.A multivalent antiviral platform based on honeycomb‐shaped DNA nanostructures (HC–Urumin) is developed to enhance the potency and breadth of the host defense peptide Urumin. Through spatially patterned trimeric presentation, HC–Urumin disrupts influenza A virus entry, improves cell viability, and reduces disease severity in vivo‐offering a modular and ...
Saurabh Umrao +11 more
wiley +1 more source
Bounded‐excess flows in cubic graphs [PDF]
Journal of Graph Theory, 2020 AbstractAn (r, α)‐bounded‐excess flow ((r, α)‐flow) in an orientation of a graph G = (V, E) is an assignment f : E → [1, r−1], such that for every vertex x ∈ V, . E+(x), respectively E−(x), is the set of edges directed from, respectively toward x. Bounded‐excess flows suggest a generalization of Circular nowhere‐zero flows (cnzf), which can be regarded
openaire +3 more sources
Robust and Reversible Thermofluorescence in Solvent‐Free Thermoplastic Polyurethane Composites
Advanced Functional Materials, EarlyView.Thermofluorescent polymer composites with high‐contrast optical outputs are prepared by solvent‐free blending of indenoquinacridone dye into a thermoplastic polyurethane matrix. The temperature‐dependent fluorescence originates from aggregation–dissociation of the dye molecules, regulated by competing hydrogen bonds from the polymer matrix.
Guanghua Yu +8 more
wiley +1 more source
On Hamiltonian Cycles in Claw-Free Cubic Graphs
Discussiones Mathematicae Graph Theory, 2022 We show that every claw-free cubic graph of order n at least 8 has at most 2⌊n4⌋{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
doaj +1 more source
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, EarlyView.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Graphs of Acyclic Cubical Complexes
European Journal of Combinatorics, 1996 A cubical complex is a finite set \({\mathfrak K}\) of cubes of any dimensions which is closed under taking subcubes and non-empty intersections. Its vertices are null-dimensional cubes of \({\mathfrak K}\), and it is said to be conformal if any set of vertices is included in a member of \({\mathfrak K}\) whenever each pair of its vertices is contained
Bandelt, Hans-Jürgen, Chepoi, Victor
openaire +1 more source