This paper reports a methodology for fast analysis of two important antioxidants: tyrosol and oleuropein in real samples of alimentary oils by using a ready-to-use portable microfluidic system (MicruX ® iHVStat) based on microchips electrophoresis with electrochemical detection. The portable system integrates for the first time a high voltage power supply and a bipotentiostat for using microflu...

distribution of magnetic fields in the quiet-sun internetwork areas has been affected by weak polarization (in particular stokes q and u) signals. to improve the signal-to-noise ratio (snr) of the weak polarization signals, several approaches, including temporal integrations, have been proposed in the literature. in this study, we aim to investigate a proper temporal-integration time with which...

A paired-dominating set of a graph is a dominating set of vertices whose induced subgraph has a perfect matching, while the paired-domination number is the minimum cardinality of a paired-dominating set in the graph. Recently, Chen, Sun and Xing [Acta Mathematica Scientia Series A Chinese Edition 27(1) (2007), 166–170] proved that a cubic graph has paired-domination number at most three-fifths ...

PrCa, P., Graphs and topologies on discrete sets, Discrete Mathematics 103 (1992) 189-197. We show that a graph admits a topology on its node set which is compatible with the usual connectivity of undirected graphs if, and only if, it is a comparability graph. Then, we give a similar condition for the weak connectivity of oriented graphs and show there is no topology which is compatible with th...

Abstract. A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial graph. ...

A popular theory of self-organized criticality predicts that the stationary density of the Abelian sandpile model equals the threshold density of the corresponding fixed-energy sandpile. We recently announced that this "density conjecture" is false when the underlying graph is any of Z2, the complete graph K(n), the Cayley tree, the ladder graph, the bracelet graph, or the flower graph. In this...

Combining the concept of a fractional ( g , f )-covered graph with that ID-( )-factor-critical graph, we define covered graph. This paper reveals relationship between some parameters and existence graphs. A sufficient condition for being is presented. In addition, demonstrate sharpness main result in this by constructing special class. Furthermore, other parameters(such as binding number, tough...

The square of a graph G, denoted by G, is obtained from G by putting an edge between two distinct vertices whenever their distance is two. Then G is called a square root of G. Deciding whether a given graph has a square root is known to be NP-complete, even if the root is required to be a split graph, that is, a graph in which the vertex set can be partitioned into a stable set and a clique. We...

The square of a graph G, denoted by G, is obtained from G by putting an edge between two distinct vertices whenever their distance is two. Then G is called a square root of G. Deciding whether a given graph has a square root is known to be NP-complete, even if the root is required to be a split graph, that is, a graph in which the vertex set can be partitioned into a stable set and a clique. We...