OPTIMIZATION IN SHELL GRAPH FAMILIES THROUGH HARMONIOUS DYNAMIC COLORING
This study introduces a new approach in graph coloring known as harmonious dynamic coloring which is useful in optimization of social network analysis, telecommunications, airspace, resource allocation and related engineering problems.
Shanthini D, Raji M
core +1 more source
The aesthetic emotional expression of piano music art in the background of Internet of things. [PDF]
Zhang X, Kang Q.
europepmc +1 more source
Maximal independence and regularity of Al/Si distributions in disordered phyllosilicates 2:1
The distribution of aluminium cations in disordered phyllosilicates is analysed according to the concepts of maximal independence and regularity.As an extension of previous works, we analyse regularity in disordered Al/Si distributions in phyllosilicates 2:1. The method is based on an analysis of maximal independent sets in a labelled quotient graph of
Montauban Moreira de Oliveira Jr +1 more
wiley +1 more source
Odd mean labeling for two star graph
In this paper further result on odd mean labeling is discussed. We prove that the two star G = K 1,m ∧ K 1,n is an odd mean graph if and only if |m − n| ≤ 3.
Silviya Francis, S. Sudhakar, V. Balaji
core +1 more source
Induced packing of odd cycles in a planar graph
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in time when the input graph is planar.
Kamiński, M. +3 more
core +2 more sources
Synthesis and Comprehensive in Vivo Activity Profiling of Olean-12-en-28-ol, 3β-Pentacosanoate in Experimental Autoimmune Encephalomyelitis: A Natural Remyelinating and Anti-Inflammatory Agent. [PDF]
Senol H +7 more
europepmc +1 more source
Discrete homotopy hypothesis for n$n$‐types
Abstract We show that discrete and classical homotopy theories are equivalent after localizing at n$n$‐equivalences for any non‐negative integer n$n$. By constructing an explicit homotopy inverse to the graph nerve functor associating an n$n$‐fibrant cubical set to a graph, we are also able to give explicit computations of several previously unknown ...
Daniel Carranza, Krzysztof Kapulkin
wiley +1 more source
Bounds for the harmonious chromatic number of a graph
The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (Journal of Graph Theory, 1991, pp. 345-347 and 629-636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J.
Krasikov, I +3 more
core +1 more source
Effects of Elastodontic Appliance on the Pharyngeal Airway Space in Class II Malocclusion. [PDF]
Patano A +12 more
europepmc +1 more source
On Graph Odd Edge-Colorings and Odd Edge-Coverings [PDF]
In this paper, we fully resolve two major conjectures on odd edge-colorings and odd edge-coverings of graphs, proposed by Petru{\v{s}}evski and {\v{S}}krekovski ({\it European Journal of Combinatorics,} 91:103225, 2021).
Liu, Xiao-Chuan, Yang, Xu
core +1 more source

