bluuebunny/crossref_metadata_2025_split huggingface dataset:
Generation of Cubic graphs
Authors: Brinkmann Gunnar , Goedgebeur Jan , Mckay Brendan D. 
Published: August 2021

Discrete Algorithms
We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.
Sturmian Sequences and Invertible Substitutions
Authors: Peng Li , Tan Bo 
Published: August 2021

Combinatorics
It is known that a Sturmian sequence S can be defined as a coding of the orbit of rho (called the intercept of S) under a rotation of irrational angle alpha (called the slope). On the other hand, a fixed point of an invertible substitution is Sturmian. Naturally, there are two interrelated questions: (1) Given an invertible substitution, we know that its fixed point is Sturmian. What is the slope and intercept? (2) Which kind of Sturmian sequences can be fixed by certain non-trivial invertible substitutions? In this paper we give a unified treatment to the two questions. We remark that though the results are known, our proof is very elementary and concise.
On the minimal distance of a polynomial code
Authors: Pach Peter Pal , Szabo Csaba 
Published: August 2021

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity
For a polynomial f(x) is an element of Z(2)[x] it is natural to consider the near-ring code generated by the polynomials f circle x, f circle x(2) ,..., f circle x(k) as a vectorspace. It is a 19 year old conjecture of Gunter Pilz that for the polynomial f (x) - x(n) broken vertical bar x(n-1) broken vertical bar ... broken vertical bar x the minimal distance of this code is n. The conjecture is equivalent to the following purely number theoretical problem. Let (m) under bar = \1, 2 ,..., m\ and A subset of N be an arbitrary finite subset of N. Show that the number of products that occur odd many times in (n) under bar. A is at least n. Pilz also formulated the conjecture for the special case when A = (k) under bar. We show that for A = (k) under bar the conjecture holds and that the minimal distance of the code is at least n/(log n)(0.223). While proving the case A = (k) under bar we use different number theoretical methods depending on the size of k (respect to n). Furthermore, we apply several estimates on the distribution of primes.
Bounds for the minimum oriented diameter
Authors: Kurz Sascha , Laetsch Martin 
Published: August 2021

Graphs and Algorithms
We consider the problem of determining an orientation with minimum diameter MOD(G) of a connected and bridge-less graph G. In 2001 Fomin et al. discovered the relation MOD(G) <= 9 gamma(G) - 5 between the minimum oriented diameter and the size gamma(G) of a minimum dominating set. We improve their upper bound to MOD(G) <= 4 gamma(G).
alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit
Authors: Brinkmann Gunnar , Crevals Simon , Melot Hadrien , Rylands Leanne , Steffen Eckhard 
Published: August 2021

Graph Theory
We present theoretical and computational results on alpha-labelings of trees. The theorems proved in this paper were inspired by the results of a computer investigation of alpha-labelings of all trees with up to 26 vertices, all trees with maximum degree 3 and up to 36 vertices, all trees with maximum degree 4 and up to 32 vertices and all trees with maximum degree 5 and up to 31 vertices. We generalise a criterion for trees to have nonzero alpha-deficit, and prove an unexpected result on the alpha-deficit of trees with a vertex of large degree compared to the order of the tree.
On neighbour-distinguishing colourings from lists
Authors: Horňák Mirko , WoźniaK Mariusz 
Published: August 2021

Graphs and Algorithms
An edge colouring of a graph is said to be neighbour-distinguishing if any two adjacent vertices have distinct sets of colours of their incident edges. In this paper the list version of the problem of determining the minimum number of colours in a neighbour-distinguishing colouring of a given graph is considered.
Some results on stable sets for k-colorable P₆-free graphs and generalizations
Authors: Mosca Raffaele 
Published: August 2021

Graphs and Algorithms
This article deals with the Maximum Weight Stable Set (MWS) problem (and some other related NP-hard problems) and the class of P-6-free graphs. The complexity status of MWS is open for P-6-free graphs and is open even for P-5-free graphs (as a long standing open problem). Several results are known for MWS on subclasses of P-5-free: in particular, MWS can be solved for k-colorable P-5-free graphs in polynomial time for every k (depending on k) and more generally for (P-5, K-p)-free graphs (depending on p), which is a useful result since for every graph G one can easily compute a k-coloring of G, with k not necessarily minimum. This article studies the MWS problem for k-colorable P-6-free graphs and more generally for (P-6, K-p)-free graphs. Though we were not able to define a polynomial time algorithm for this problem for every k, this article introduces: (i) some structure properties of P-6-free graphs with respect to stable sets, (ii) two reductions for MWS on (P-6; K-p)-free graphs for every p, (iii) three polynomial time algorithms to solve MWS respectively for 3-colorable P-6-free, for 4-colorable P-6-free, and for (P-6, K-4)-free graphs (the latter allows one to state, together with other known results, that MWS can be solved for (P-6, F)-free graphs in polynomial time where F is any four vertex graph).
Immersion containment and connectivity in color-critical graphs
Authors: Abu-Khzam Faisal N. , Langston Michael A. 
Published: August 2021

Graph Theory
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. It is shown that a t-chromatic graph G contains either an immersed Kt or an immersed t-chromatic subgraph that is both 4-vertex-connected and t-edge-connected. This gives supporting evidence of our conjecture that if G requires at least t colors, then Kt is immersed in G.
Acyclic chromatic index of fully subdivided graphs and Halin graphs
Authors: Basavaraju Manu 
Published: August 2021

Graph Theory
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). A graph G is called fully subdivided if it is obtained from another graph H by replacing every edge by a path of length at least two. Fully subdivided graphs are known to be acyclically edge colorable using Δ+1 colors since they are properly contained in 2-degenerate graphs which are acyclically edge colorable using Δ+1 colors. Muthu, Narayanan and Subramanian gave a simple direct proof of this fact for the fully subdivided graphs. Fiamcik has shown that if we subdivide every edge in a cubic graph with at most two exceptions to get a graph G, then a'(G)=3. In this paper we generalise the bound to Δ for all fully subdivided graphs improving the result of Muthu et al. In particular, we prove that if G is a fully subdivided graph and Δ(G) ≥3, then a'(G)=Δ(G). Consider a graph G=(V,E), with E=E(T) ∪E(C) where T is a rooted tree on the vertex set V and C is a simple cycle on the leaves of T. Such a graph G is called a Halin graph if G has a planar embedding and T has no vertices of degree 2. Let Kn denote a complete graph on n vertices. Let G be a Halin graph with maximum degree Δ. We prove that, a'(G) = 5 if G is K4, 4 if Δ = 3 and G is not K4, and Δ otherwise.
Operations on partially ordered sets and rational identities of type A
Authors: Boussicault Adrien 
Published: August 2021

Combinatorics
We consider the family of rational functions ψw= ∏( xwi - xwi+1 )-1 indexed by words with no repetition. We study the combinatorics of the sums ΨP of the functions ψw when w describes the linear extensions of a given poset P. In particular, we point out the connexions between some transformations on posets and elementary operations on the fraction ΨP. We prove that the denominator of ΨP has a closed expression in terms of the Hasse diagram of P, and we compute its numerator in some special cases. We show that the computation of ΨP can be reduced to the case of bipartite posets. Finally, we compute the numerators associated to some special bipartite graphs as Schubert polynomials.
The Magnus-Derek game in groups
Authors: Gerbner Dániel 
Published: August 2021

Combinatorics
The Magnus-Derek game (also called the maximal variant of the vector game), introduced by Nedev and Muthukrishnan is the following: a token is moved around a table with n positions. In each round of the game Magnus chooses a number and then Derek chooses a direction (clockwise or counterclockwise), and the token moves that many positions into that direction. The goal of Magnus is to maximize the number of positions visited, the goal of Derek is the opposite. In the minimal variant of the game the goals of the two players are exchanged: Magnus wants to minimize the number of positions visited and Derek wants the opposite. Here we introduce a generalization of these games: the token is moved in a group, Magnus chooses an element of the group and Derek decides if the current position is multiplied or divided by that element.
On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
Authors: Kowalski Dariusz , Krzywdziński Krzysztof 
Published: August 2021

Distributed Computing and Networking
We study time and message complexity of the problem of building a BFS tree by a spontaneously awaken node in ad hoc network. Computation is in synchronous rounds, and messages are sent via point-to-point bi-directional links. Network topology is modeled by a graph. Each node knows only its own id and the id's of its neighbors in the network and no pre-processing is allowed; therefore the solutions to the problem of spanning a BFS tree in this setting must be distributed. We deliver a deterministic distributed solution that trades time for messages, mainly, with time complexity O(D . min(D; n=f(n)) . logD . log n) and with the number of point-to-point messages sent O(n. (min(D; n=f(n))+f(n)) . logD. log n), for any n-node network with diameter D and for any monotonically non-decreasing sub-linear integer function f. Function f in the above formulas come from the threshold value on node degrees used by our algorithms, in the sense that nodes with degree at most f(n) are treated differently that the other nodes. This yields the first BFS-finding deterministic distributed algorithm in ad hoc networks working in time o(n) and with o(n2) message complexity, for some suitable functions f(n) = o(n= log2 n), provided D = o(n= log4 n).
The Erdős-Sós conjecture for geometric graphs
Authors: Barba Luis , Fabila-Monroy Ruy , Lara Dolores , Leaños Jesús , Rodrıguez Cynthia , Salazar Gelasio , Zaragoza Francisco 
Published: August 2021

Combinatorics
Let f(n,k) be the minimum number of edges that must be removed from some complete geometric graph G on n points, so that there exists a tree on k vertices that is no longer a planar subgraph of G. In this paper we show that ( 1 / 2 )n2 / k-1-n / 2≤f(n,k) ≤2 n(n-2) / k-2. For the case when k=n, we show that 2 ≤f(n,n) ≤3. For the case when k=n and G is a geometric graph on a set of points in convex position, we completely solve the problem and prove that at least three edges must be removed.
Automaticity of primitive words and irreducible polynomials
Authors: Lacroix Anne , Rampersad Narad 
Published: August 2021

Automata, Logic and Semantics
If L is a language, the automaticity function A_L(n) (resp. N_L(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all inputs of length at most n. We provide bounds for the automaticity of the language of primitive words and the language of unbordered words over a k-letter alphabet. We also give a bound for the automaticity of the language of base-b representations of the irreducible polynomials over a finite field. This latter result is analogous to a result of Shallit concerning the base-k representations of the set of prime numbers.
Parenting Styles and Classroom Social Interaction among Senior High School Students
Authors: Ramento Norman Mark A. 
Published: August 2021

The purpose of quantitative correlational study was to determine the relationship between demographic profile, the parenting styles, and classroom social interaction of the respondents. This study included 209 senior high school students of Quinapondan National High School. The respondents accomplished the questionnaire pertaining to assess parenting style and classroom social interaction of the respondents. Quantitative data analysis methods were used including mean, frequency count and percentage as well as correlational analysis.
Age has no significant relationship with the parenting styles. It reflects an index of correlation at .137 and p-value .270. Sex also shows no correlation with the parenting styles. It has an index of correlation .068 and p-value .033. Grade level shows no significant relationship with the parenting styles. There is an index of correlation of .027 and p-value of .694. Strand shows no significant relationship with the parenting style. There is an index of correlation of .137 and p-value of .141. Family income has a low correlation with the parenting style but has no significance with the index of correlation of .223 and p-value of .141. Lastly, educational attainment of parents has also a low correlation and has significance with the parenting styles in the index of correlation of .241 and p-value of .016.
BUSINESS INTELLIGENCE ON SUPPLY CHAIN RESPONSIVENESS AND AGILE PERFORMANCE: EMPIRICAL EVIDENCE FROM MALAYSIAN LOGISTICS INDUSTRY
Authors: Kaur Kashveenjit 
Published: August 2021

Purpose: This study examine how BIS implementation affects the agile efficiency of the supply chain with the logistics industry's supply chain responsiveness. As a variable for assessing the relationship and effect on agile efficiency, business intelligence competence (managerial competence, technological competence and cultural competence) and supply chain responsiveness will be investigated.
Methodology: A survey questionnaire comprised of 39 questions using the purposive method of sampling used to select the target group and replied to the survey with the outcome of a total of 50 respondents, via SPSS, the data was further analysed to examine the relationship between all variables.
Findings: The study finds that (1) business intelligence competence has a significant positive impact on the response to the supply chain, (2) business intelligence competence has a significant positive impact on the supply chain's agile performance, (3) responsiveness to the supply chain has a significant positive impact on agile performance.
Unique contribution to theory, practice and policy: This study contributes to enhancing the quality and effectiveness of the business operation of the 3PL service provider, government customs and port department.
INFLUENCE OF MOBILE PHONE ON ENHANCING LEARNER SUPPORT SERVICES FOR DISTANCE EDUCATION PROGRAMMES
Authors: Boro Samuel 
Published: August 2021

Purpose: Mobile technologies provide an affordable and easily accessible technology that lecturers can use effectively to assist students with their studies. The general objective of the study was to evaluate influence of mobile phone on enhancing learner support services for distance education programmes.
Methodology: The paper used a desk study review methodology where relevant empirical literature was reviewed to identify main themes and to extract knowledge gaps.
Findings: From the study findings,it was concluded that most students have a smartphone and have installed applications that enable them to access the internet, but they ended up using their phones for social network and not learning purposes. Despite the fact that the phones are able to check and send emails, majority of those interviewed preferred using the computer over the phone. Most students and lecturers did not communicate over the phone in case of clarity on a certain subject even the sending of results, missing marks and such. Most administrators sent SMS regarding important dates and venues to DE students but rarely and did not send results through SMS, do not send SMS on tutorial schedules and never sent SMS giving reminders about deadlines for submitting assignments to DE students
Recommendations: The study recommended that there was a need for the universities and colleges not utilizing mobile phones should develop common email center that does not compromise privacy of the users. The service should be of high speed and able to support large data exchange. The universities should establish common social media network by registering on leading social network such as facebook or google+. The common social platform center should be administratively controlled to monitor the exchange of information for purposes of learning and support. The knowledge and scientific understanding accruing from this study should be considered by policy makers when laying down guidelines for learner support systems in distance education programmes
PENGARUH KOMITMEN ORGANISASI DAN MOTIVASI TERHADAP KINERJA PEGAWAI PT. PANIN Tbk MEDAN
Authors: Sembiring Hendri - 
Published: August 2021

Penelitian ini bertujuan untuk mengetahui pengaruh komitmen organisasi dan motivasi terhadap kinerja pegawai pada PT. Panin Bank Tbk Medan sampel penelitian seluruh karyawan Divisi Retail Lending Marketing pada PT. Panin Bank Tbk – Medan yang berjumlah 32 orang Penelitian ini menggunakan metode penelitian deskriptif kuantitatif pengujian dalam penelitian ini menggunakan analisis regresi linier berganda. Kesimpulan menunjukkan secara parsial simultan dan komitmen organisasi dan motivasi berpengaruh signifikan terhadap kinerja pegawai pada PT. Panin Bank Tbk Medan.
Kata kunci : Komitmen Organisasi, Motivasi, Kinerja Pegawai
PENGARUH GOOD CORPORATE GOVERNANCE ( DEWAN DIREKSI, DEWAN KOMISARIS, DAN KOMITE AUDIT ) TERHADAP PROFITABILITAS
Authors: Lumbanraja Thorman 
Published: August 2021

ABSTRAK

Penelitian ini dilakukan untuk mengetahui apakah good corporate governance memiliki pengaruh signifikan terhadap profitabilitas perusahaan manufaktur sektor barang dan konsumsi yang terdaftar di Bursa Efek Indonesia pada tahun 2019. Pada penelitian ini variabel good corporate governance diproksikan dengan ukuran dewan komisaris, dewan direksi dan komite audit. Sedangkan variabel profitabilitas diproksikan dengan ROA (Return on Asset) dan ROE (Return on Equity). Sampel yang digunakan sebanyak 51 perusahaan dengan metode purposive sampling.
Metode analisis data yang digunakan yaitu analisis statistik deskriptif dan uji asumsi klasik sedangkan hipotesisnya diuji dengan menggunakan analisis regresi linear berganda. Hasil yang diperoleh atas penelitian ini yaitu bahwa dewan komisaris berpengaruh positif dan tidak signifikan terhadap ROA namun berpengaruh positif dan signifikan terhadap ROE, dewan direksi berpengaruh negatif dan tidak signifikan terhadap ROA dan ROE serta komite audit berpengaruh positif dan tidak signifikan terhadap ROA dan ROE. Secara simultan dewan komisaris, dewan direksi dan komite audit berpengaruh signifikan terhadap ROA dan ROE.

Kata Kunci: Good Corporate Governance, Dewan Komisaris, Dewan Direksi, Komite Audit, Return on Asset dan Return on Equity.
TINGKAT STRES MAHASISWA S1 KEPERAWATAN TINGKAT SATU DALAM MENGHADAPI WABAH COVID 19 DAN PERKULIAHAN DARING DI STIKES KARYA HUSADA KEDIRI
Authors: Sari Melani Kartika 
Published: August 2021

The Covid-19 outbreak is a new type of disease and is highly contagious. This new virus was previously unknown before infecting many residents of Wuhan, China. This virus is now spreading to most of the world. To prevent its spread, the government urges people to stay at home and learn online. The aimed of this study was to determine the level of stress of first-degree students in the Nursing Study Program at Stikes Karya Husada in dealing with the Covid-10 outbreak and online lectures due to the outbreak. This type of research is a descriptive study with cross sectional design. Sampling was done by purposive sampling technique to get a total sample of 70 respondents. Data were collected using a questionnaire in the form of google and found that most students experienced moderate stress (38.57%), some experienced severe stress (28.57%), and mild stress (32.86%). The stressors that cause the most stress are difficulty understanding online material and worry about contracting Covid-19. Pandemic conditions that are full of uncertainty need to be addressed wisely by various parties. It takes effort to reduce stress by doing a variety of fun activities in the home that can be done by students.
Keywords: stress level, students, covid-19, online lectures
HUBUNGAN PENGETAHUAN PADA REMAJA TENTANG DAMPAK SEKS BEBAS BAGI KESEHATAN REPRODUKSI
Authors: NURIN FAUZIYAH  
Published: August 2021

Abstrak
Kematangan seksual pada remaja menyebabkan munculnya minat seksual dan keinginan remaja tentang seksual sehingga dapat mengakibatkan dampak yang negatif terhadap pergaulan remaja yang berdampak pada seks bebas. Seks bebas mempunyai resiko yang sangat besar terhadap remaja. Dampak seks bebas remaja biasanya akan mengalami kehamilan diluar nikah, terinfeksi penyakit menular seksual (PMS) dan beresiko pada psikologi remaja. Tujuan penelitian adalah untuk mengetahui hubungan pengetahuan pada remaja Tentang Dampak Seks Bebas Bagi Kesehatan Reproduksi Di SMPN I PLEMAHAN Kabupaten Kediri Tahun 2019. Desain penelitian menggunakan desain diskriptif. Populasi penelitian adalah siswa-siswi kelas IX Di SMPN I PLEMAHAN kabupaten Kediri Tahun 2019. Dengan menggunakan teknik Stratified Random Sampling diperoleh sampel sebanyak 80 responden. Teknik pengumpulan data menggunakan kuesioner. Analisa data menggunakan diskriptif. Hasil penelitian yakni responden yang pernah mendapat informasi sejumlah 80 responden (100%), dengan kriteria cukup baik 32 responden (40%), dan sebagian kecil berkriteria kurang baik 3 responden (3,75%). Jadi mayoritas responden memiliki tingkat pengetahuan berkriteria cukup baik yaitu sebanyak 32 responden (40%) dari total 80 responden. Kesimpulan dari penelitian ini berarti semakin baik pengetahuan remaja tentang dampak seks bebas, maka semakin menjauhi perbuatan seks bebas dan dapat berhati-hati dalam memilih setiap pergaulan yang aman.

Kata kunci: Pengetahuan, Remaja, Dampak Seks Bebas, Kesehatan Reproduksi.