bluuebunny/crossref_metadata_2025_split huggingface dataset:
Thermoelectric water meter energy harvesting
Authors: Gould C A 
Published: June 2020

Abstract
Domestic electronic water meters are installed by water meter utility companies to accurately measure household water usage for billing purposes, progressing from simple electromechanical systems to state-of-the art volumetric electronic smart meters with RF radio transmission, remote reading, and automatic billing capability. The motivation for this work is to replace, or increase the lifetime of, the on-board lithium-ion battery installed in electronic water meters with a thermoelectric energy harvesting solution to create a business advantage. Practical field experiments at several different water meter installations in the UK, USA, and Australia have demonstrated a temperature difference can exist between the top-side and bottom-side of a water meter, and between several different areas of the meter and the surrounding air. This temperature difference can be harnessed to generate electrical power using thermoelectricity. A prototype thermoelectric water meter energy harvesting system has been designed, and experiments demonstrate the system will operate when a temperature difference is present across the thermoelectric module, giving an output voltage of 3.7 V to power the water meter electronics directly or to provide a charge current for the existing lithium-ion battery to increase its lifetime. The work concludes it is feasible, although still challenging, to develop a solution for a novel thermoelectric powered water meter. Further work is required to address the commercial challenges that exist, develop and optimise the prototype solution into a production ready prototype, and conduct further tests using a standard UK domestic water profile at a UK water meter test site.
Coverage measurement and analysis during verification of DUT
Authors: Boiadzhian Armen , Lisik Zbigniew , Hahanova Irina 
Published: June 2020

Abstract
Verification involves checking the compliance of the system with the requirements of its specification at each level of detail. Given a certain complexity inherent in real systems, formal methods are not applicable for such a resister-transistor level (RTL)-description check, since they are associated with extremely high computational complexity. In practice, in this case, the device’s RTL code is checked by applying test stimulus to the RTL model and controlling the response to either the specification or the reference model. The applied techniques for writing and generating tests do not have a priori guarantees covering all possible situations that allow us to identify bugs in design.
On total edge irregularity strength of tadpole chain graph Tr(6, n)
Authors: Nurdini E , Rosyida I , Mulyono  
Published: June 2020

Abstract
Given a graph G(V, E) with a non-empty set of vertices V and a setof edges E. A total labelling f: V ∪ E → {1,2,…, k} is called an edge irregular total labeling if the weight of every edge is distinct. The weight of anedgee, under the total labeling f, is the sum of label of edgee and all labels of vertices that are incident to e. In other words, wt(xy) = f(xy) + f(x) + f(y). The total edge irregularity strength of G, denoted by tes(G) is the minimum k used to label graph G with the edge irregular total labeling. A tadpole chain graph of length r, denoted as Tr
(6, n), is a chain graph that consists of tadpole graph T (6, n) on each block. In this paper, we get

t
e
s
(

T
r

(
6
,
n
)
)
=

⌈

(
6
+
n
)
r
+
2

3

⌉

and construct an algorithm to find it.
Sigma chromatic number of graph coronas involving complete graphs
Authors: Garciano A D , Lagura M C T , Marcelo R M 
Published: June 2020

Abstract
Let c : V(G) → ℕ be a coloring of the vertices in a graph G. For a vertex u in G, the color sum of u, denoted by σ(u), is the sum of the colors of the neighbors of u. The coloring c is called a sigma coloring of G if σ(u) ≠ σ(v) whenever u and v are adjacent vertices in G. The minimum number of colors that can be used in a sigma coloring of G is called the sigma chromatic number of G and is denoted by σ(G). Given two simple, connected graphs G and H, the corona of G and H, denoted by G ⊙ H, is the graph obtained by taking one copy of G and |V(G)| copies of H and where the ith vertex of G is adjacent to every vertex of the ith copy of H. In this study, we will show that for a graph G with |V(G)| ≥ 2, and a complete graph Kn
of order n, n ≤ σ(G ⊙ Kn
) ≤ max {σ(G), n}. In addition, let Pn
and Cn
denote a path and a cycle of order n respectively. If m, n ≥ 3, we will prove that σ(Km
⊙ Pn
) = 2 if and only if

m
≤
n
−
2

⌊

n
4

⌋

+
2

. If n is even, we show that σ(Km
⊙ Cn
) = 2 if and only if

m
≤
n
−
2

⌈

n
4

⌉

+
2

. Furthermore, in the case that n is odd, we show that σ(Km
⊙ Cn
) = 3 if and only if

m
≤
H

(

⌈

n
4

⌉

−
1
,
n
−

⌈

n
4

⌉

)

where H(r, s) denotes the number of lattice points in the convex hull of points on the plane determined by the integer parameters r and s.
Twin chromatic indices of some graphs with maximum degree 3
Authors: Tolentino J D , Marcelo R M , Tolentino M A C 
Published: June 2020

AbstractLetk≥ 2 be an integer andGbe a connected graph of order at least 3. A twink-edge coloring ofGis a proper edge coloring ofGthat uses colors from ℤkand that induces a proper vertex coloring onGwhere the color of a vertexvis the sum (in ℤk) of the colors of the edges incident withv. The smallest integerkfor whichGhas a twink-edge coloring is the twin chromatic index ofGand is denoted byχt′(G). In this paper, we determine the twin chromatic indices of circulant graphsCn(1,n2), and some generalized Petersen graphs such asGP(3s,k),GP(m, 2), andGP(4s,l) wheren≥ 6 andn≡ 0 (mod 4),s≥ 1,k≢ 0 (mod 3), m ≥ 3 and m ∉ {4, 5}, andlis odd. Moreover, we provide some sufficient conditions for a connected graph with maximum degree 3 to have twin chromatic index greater than 3.
Colour segmentation of Gram-Negative bacteria using graph Quadratic Form and Random Walker
Authors: Satoto B D , Utoyo I , Rulaningtyas R 
Published: June 2020

Abstract
Gram-negative bacteria are one of the bacteria that are often pathogenic to the human body. This bacterium causes resistance due to nosocomial with other Gram-negative bacteria. In the medical stage, the bacteria that cause nosocomial traits removed first before antibiotic therapy carried out on the main bacteria. To identify these bacteria, the clinical laboratory needs to make manual observations under a microscope. The approach taken in this research is using the image processing technique. There are four stages: pre-processing, segmentation, feature extraction, and identification. Segmentation is a stage to emphasize the object sought in an image. In this research, the approach used to capture objects is one of them using the Graph Quadratic Form algorithm. This algorithm chose because it can determine the shortest distance of the object from the nearest node so that the process of convergence of the object search becomes faster. The result is that this algorithm is better than the morphology-based algorithm and the contour-based algorithm, while the number of samples taken from 50 patients affected by Gram-negative bacteria. The image under research has a size of 512x512 pixels, a resolution of 72 dpi with a bit depth of 24. The segmentation process is carried out on Gram-negative bacterial images using two classes producing an average accuracy of 89% to Ground truth.
Characteristic polynomial of anti-adjacency matrix of directed cyclic friendship graph
Authors: Anzana N , Aminah S , Utama S , Silaban D R 
Published: June 2020

Abstract
Graph theory has some applications. One of them is used to do social network analysis as in Facebook with each person as nodes and every like, share, comment, tag as edges. Usually a network can be represented by a graph. Analysing a network is the same as analysing the structure of a graph. A structure of a graph can be analysed through some matrix representations such as anti-adjacency matrix. The entries of the anti-adjacency matrix of a directed graph represent the presence or absence of directed arcs from a vertex to the others. This paper is about the properties of the anti-adjacency matrix of directed cyclic friendship graph, those are the characteristic polynomial and the eigenvalues of the anti-adjacency matrix. The method used to obtain the general form of the coefficients of the characteristic polynomial is by adding up the determinant values of all directed induced subgraphs, cyclic or acyclic, of the directed cyclic friendship graph. Furthermore, the methods used to find theeigenvalues of the anti-adjacency matrix of directed cyclic friendship graph are the substitution method and factorization method. The result of this researcharethe general form of the coefficients of the characteristic polynomial and the general form of the eigenvalues of the anti-adjacency matrix depend on the number of triangles in directed cyclic friendship graph.
The matrix Jacobson graph of fields
Authors: Humaira S , Astuti P , Muchtadi-Alamsyah I , Erfanian A 
Published: June 2020

Abstract
The notion of Jacobson graph and n-array Jacobson graph of a commutative ring were introduced in 2012 and 2018, respectively, by Azimi et al and Ghayour et al. In this article we generalize them to matrix Jacobson graph. Let R be a commutative ring. The matrix Jacobson graph of a ring R, denoted

J

(
R
)

m
×
n

, is defined as a graph with vertex set is the set of matrix of ring without the matrix of its Jacobson such that two distinct vertices A, B are adjacent if and only if 1 − det(AtB) is not a unit of ring. In this article we study the matrix Jacobson graph where the underlying ring R is a finite field. Since any matrix of size m × n over a field F can be considered as a linear mapping from linear space Fm
to Fn
, we employ the structure of linear mappings on finite dimensional vector spaces to derive some properties of square and non square matrix Jacobson graph of fields, including their diameters.
On the set chromatic number of the join and comb product of graphs
Authors: Felipe B C L , Garciano A D , Tolentino M A C 
Published: June 2020

Abstract
A vertex coloring c : V(G) → ℕ of a non-trivial connected graph G is called a set coloring if NC(u) ≠ NC(v) for any pair of adjacent vertices u and v. Here, NC(x) denotes the set of colors assigned to vertices adjacent to x. The set chromatic number of G, denoted by χs
(G), is defined as the fewest number of colors needed to construct a set coloring of G. In this paper, we study the set chromatic number in relation to two graph operations: join and comb prdocut. We determine the set chromatic number of wheels and the join of a bipartite graph and a cycle, the join of two cycles, the join of a complete graph and a bipartite graph, and the join of two bipartite graphs. Moreover, we determine the set chromatic number of the comb product of a complete graph with paths, cycles, and large star graphs.
On Ramsey (P
3, C
7)-minimal graphs
Authors: Muttaqin G A , Rahmadani D , Purwanto  , Sulandra I M 
Published: June 2020

Abstract
Let F, G and H be graphs. Notation F → (G, H) means that there is any two-coloring, say red and blue, of all edges of F which contains red subgraph isomorphic to G or blue subgraph isomorphic to H. The graph F is Ramsey (G, H)-minimal if F → (G, H) but F − e ↛ (G, H) for any e ∈ E(F).The class of all Ramsey (G, H)-minimal graphs will be denoted by R(G, H). According to the previous study, we know that graphs in R(P
3, C
7) have at least 13 edges.In this paper, we find graphs in R(P
3, C
7) having seven vertices and 13 and 14 edges, respectively. Further, we give some necessary conditions for Ramsey (P
3, C
7)-minimal graphs with seven vertices.
On spectra of square edge-corona graphs
Authors: Zulkarnain S R , Rinurwati  
Published: June 2020

Abstract
Given two connected graphs, G and H. The Order and size of Gand H, are u and v, and m and n, respectively. Graph G square edge-corona H, denoted by G ⋄2
H and defined as G ⋄2
H: = (G ⋄ H) ⋄ H, that is a graph obtained from G, the first v-copies of H that is Hh
, with h ∈ {1,2,…, v], and the second v(1 + 2n + m)-copies of H that is Hhk
, with h ∈ {1,2,…, v] and k ∈ {1,2,…,1 + 2n + m] and joining the terminal vertices of eh
∈ E(G), with eh
= ihjh
and ih
, jh
∈ V(G), to all vertices of Hh
, and then joining the terminal vertices of ek
= rksk
, ek
∈ G ⋄ H, to all vertices of Hhk
. In this paper, the spectrum of the adjacency, Laplacian, and signless-Laplacian matrices of the graph G ⋄2
H will be analyzed further.
Local super antimagic total vertex coloring of some wheel related graphs
Authors: Pratama S A , Setiawani S , Slamin  
Published: June 2020

Abstract
Let G be a simple and finite graph with vertex set V and edge set E. The local antimagic total labeling of G is a map from V ∪ E to the set of positive integers from 1 to |V| + |E| such that the weight of two adjacent vertices are distinct. The weight of a vertex v is calculated by the sum of the label of the vertex v and the labels of all edges incident to it. If the vertices of G is labelled by the smallest labels, that is, {1, 2,…, |V|}, then the such labeling is called local super antimagic total labeling. Thus, the local super antimagic total labeling induces a proper vertex coloring of G where the vertex v is colored by the weight of vertex v. The minimum number of colors taken over all colorings induced by super local antimagic total labeling of G, is called local super antimagic total chromatic number of graph G, and denoted by χlsat
(G). In this paper, we consider the local super antimagic total chromatic number of some wheel related graphs such as fans, even gear graphs, and sun flower graphs.
Odd harmonious labeling on squid graph and double squid graph
Authors: Febriana F , Sugeng K A 
Published: June 2020

AbstractAn injective functionffrom set of vertices in graphGto a set of {0,1,…,|E| − 1} is called an odd harmonious labeling if the functionfinduced the edge functionf* from the set of edges ofGto a set of odd positive integer number {1,3,5,…,2|E| − 1} withf*(xy) =f(x) +f(y) for every edgexyinE.Graph that has an odd harmonious labeling is called odd harmonious graph. The squid graphTn,kis a graph which is obtained from a cycleCnand we addkpendant to one vertex of the cycle. It is known thatCnis an odd harmonious graph if and only ifn= 0 mod 4. However, by adding at least one pendant in the cycle graph, we can label the new graph odd harmoniously for all even number of vertices. In this paper, we showed that the graphTn,kandT2n,kare an odd harmonious graph, forn= 0 (mod 2),n≥ 4 andk≥ 1. The construction of the odd harmonious labeling of the graphTn,kandT2n,kare inspired by the odd harmonious labeling ofCnforn= 0(mod 4).
Unicyclic Ramsey (P
3, Pn
)-minimal graphs obtained from trees in the same class
Authors: Rahmadani D , Assiyatun H , Baskoro E T 
Published: June 2020

Abstract
If G, H and F are finite and simple graphs, notation F → (G, H) means that for any red-blue coloring of the edges of F, there is either a red subgraph isomorphic to G or a blue subgraph isomorphic to H. A graph F is a Ramsey (G, H)-minimal graph if F → (G, H) and for every e ∈ E(F), graph F − e ↛ (G, H). The class of all Ramsey (G, H)-minimal graphs (up to isomorphism) will be denoted by R(G, H). The characterization of all graphs in the infinite class R(P
3, Pn
) is still open, for any n ≥ 4. In this paper, we find an infinite families of trees in R(P
3, P
5). We determine how to construct unicyclic graphs in R(P
3, Pn
), for any n ≥ 5 from trees in the same class. Further, we give some properties for the unicyclic graphs constructed from trees in R(P
3, Pn
), for any n ≥ 5.
On the super

H

-decomposition local antimagic total labeling of subdivision graph
Authors: Fauziah S L , Dafik  , Agustin I H , Alfarisi R 
Published: June 2020

Abstract
We assume that G = G(V, E) is a finite, simple, and undirected graph with V as set of vertices and E as set of edges. A bijection g : V (G) ∪ E(G) → {1, 2, 3, …|V(G)| + |E(G)} is called a super

H

-decomposition local antimagic total labeling for any two adjacent subgraph

ℋ
i

and

ℋ
j

,

w
(

ℋ
i

)
≠
w
(

ℋ
j

)

, where

w
(
ℋ
)
=

∑

v
∈
V
(
ℋ
)

f
(
v
)

+

∑

e
∈
E
(
ℋ
)

f
(
e
)

. The chromatic number of super

H

-decomposition local antimagic total labeling is minimum number of colors in super

H

-decomposition local antimagic total labeling and denoted by

γ

l
a
t
ℋ

(
G
)

. In this paper, we used some subdivision graph. Such as subdivision of star graph (S(Sn
)), subdivision of sun graph (M(Mn
)), subdivision of wheel graph (S(Wn
)). The subdivision graph S(G) of a graph G is the graph obtained from G by replacing each of its edges by a path of length two.
Elegant labeling of some graphs
Authors: Prihandini R M , Dafik  , Agustin I H , Alfarisi R , Adawiyah R 
Published: June 2020

Abstract
An elegant labeling on graph G with α vertices and β edges is an injective (one-to-one) mapping from the set of vertices V(G) to the set of non-negative integers {0,1, 2, 3, …,β} in such a way that the set of values on the edges obtained by the sums mod β + 1 of the labels of their end vertices is {1, 2, 3,4,…, β}. The purpose of this research is to prove that several graphs, namely diamond ladder admit an elegant labeling. We also look for relationships between Edge Antimagic Vertex Labeling and Elegant Labeling.
On the local (adjacency) metric dimension of split related wheel graphs
Authors: Albirri E R , Dafik  , Agustin I H , Adawiyah R , Alfarisi R , Prihandini R M 
Published: June 2020

Abstract
Let G be a simple and connected graph. When G graph is added by new vertex v’ in graph G (where the number of vertex v’ corresponds to vertex v) such that if v
1 adjacent to v
2 in G then v
1 will adjacent to v
2 in G. The G graph is called split graph. When G has m
v’-vertices, then it is called m-splitting graph. Let V(G) is a set of vertices and let E(G) is a set of edges. They are two sets which form graph G. W is called a local adjacency resolving set of G if for every two distinct vertices x,y and x adjacent with y then rA(x|W) = rA(y|W). The local adjacency metric basis is a minimum local adjacency resolving set in G. The cardinality of vertices in the basis is a local adjacency metric dimension of G (dimA,l
(G)). We present the exact value of local adjacency metric dimension of m-splitting related wheel graphs.
On the local antimagic vertex coloring of sub-devided some special graph
Authors: Dafik  , Agustin I H , Marsidi  , Kurniawati E Y 
Published: June 2020

Abstract
A graph G is an ordered pair of sets G(V, E), where V is a set of vertices and the elements of set E are usually called edges. The concept of graph labeling has recently gained a lot of popularity in the area of graph theory. his popularity is due not only to the mathematical challenges of graph labelings but also to the wide range of applications that graph labeling offer to other brances of science, for instance, x-ray, cryptography, coding theory, circuit design and communication network design. A graph labeling we mean an assignment of integers to elements of a graph such as vertex, edge, and both. Local antimagic of a graph was motivated by Arumugam et al.. Thus, we initiate to developed the concept of local antimagic vertex coloring for subdevided graphs. A graph G called sub-devided if the graph G be the graph obtained by inserting a vertex to each edge of the graph G. Definition the concept local antimagic vertex coloring is f : E(G) → {1, 2, 3…, |E(G)|} if for any two adjacent vertices a
1 and a
2, w(a
1) = w(a
2), where for v ∈ G,

w
(
a
)
=

∑

e
∈
E
(
a
)

f
(
e
)

, where E(a) and V(a) are respectively the set of edges incident to a. The local antimagic vertex labeling induces a proper vertex coloring of graph G if each vertex a is assigned the color w(a). The minimum colors needed to coloring the vertices in graph G called local antimagic vertex chromatic number, denoted by χla
(G). In this paper we study the local antimagic vertex coloring of sub-devided some special graph as follows SFn,m
, SSn,m
, SWn,m
and SFn,m
.
Properties of cartesian multiplication operations in complete fuzzy graphs, effective fuzzy graphs and complement fuzzy graphs
Authors: Yulianto T , Hayati N , Agustin I H , Amalia R , Faisol  , Kuzairi  , Irwansyah B 
Published: June 2020

Abstract
This study aims to investigate the properties of cartesian multiplication operations on fuzzy graphs. The properties investigated are cartesian multiplication on complete fuzzy graph, effective fuzzy graph and complement fuzzy graph. The method used in this study is a theoretical research method. The results showed that the Cartesian multiplication of two complete fuzzy graphs is not a complete fuzzy graph. The Cartesian multiplication of the two effective fuzzy graphs is the effective fuzzy graph, while for the Cartesian multiplication of the two fuzzy complement graphs, it is not the same as the Cartesian multiplication of the two effective fuzzy graphs.
On the local multiset dimension of graph with homogenous pendant edges
Authors: Adawiyah R , Dafik  , Agustin I H , Prihandini R M , Alfarisi R , Albirri E R 
Published: June 2020

Abstract
Let G be a connected graph with E as edge set and V as vertex set. rm
(v|W) = {d(v, s
1), d(v,
s
2),…, d(v, sk
)} is the multiset representation of a vertex v of G with respect to W where d(v, si
) is a distance between of the vertex v and the vertices in W for k—ordered set W = {s
1, s
2,…,sk
} of vertex set G. If rm
(v|W) = rm
(u|W) for every pair u, v of adjacent vertices of G, we called it as local resolving set of G. The minimum cardinality of local resolving set W is called local multiset dimension. It is denoted by μl
(G). Hi
≅ H, for all i ∈ V(G). If H ≅ K
1, G ⊙ H is equal to the graph produced by adding one pendant edge to every vertex of G. If H ≅ mK
1 where mK
1 is union of trivial graph K
1, G ⊙ H is equal to the graph produced by adding one m pendant edge to every vertex of G. In this paper, we analyze the exact value of local multiset dimension on some graphs with homogeneous pendant edges.
Implementation of xgboost for classification of parkinson’s disease
Authors: Abdurrahman G , Sintawati M 
Published: June 2020

Abstract
Parkinson’s Disease (PD) is an advanced neurodegenerative illness. It is about 90% of PD sufferer shows speech disorders in the initial stages. Hence, in this research, speech features were applied to classify this illness. The most famous speech features used in PD research are jitter, shimmer, fundamental frequency parameters, harmonicity parameters, Recurrence Period Density Entropy (RPDE), Detrended Fluctuation Analysis (DFA), and Pitch Period Entropy (PPE).Those features were then called as baseline features used in this research. In this research, the XGBoost algorithm was used for the classification of PD. Initially, the whole baseline features were used in the XGBoost algorithm and obtained an accuracy score of the model 84.80%. For improving the model, feature selection was performed by plotting feature importance, which causes features of locShimmer (Fscore = 3) was excluded from the model. After feature selection was performed, the accuracy score of the model has increased to 85.60 %. We tried to improve the model using for second features selection, by excluding features with F-score values less than 20. However, after performed this feature selection, the accuracy of the model was decreased to 84.40 %. Thus, the model used is the model with an accuracy of 85.60%.