Digital Commons Network^™

An Empirical Look At The Assumption That Small Businesses Maximize Profits, Carole E. Scott

Southern Business Review (Archived)

Carole Scott is Professor of Economics at West Georgia College, Carrollton. Georgia.

A Managerial Assessment Of The Social Auditing Process, Carl Joiner

Southern Business Review (Archived)

Carl Joiner is an Associate Professor in the School of Business, Mercer University, Macon. Georgia.

Radio Number Of Hamming Graphs Of Diameter 3, Jason Devito, Amanda Niedzialomski, Jennifer Warren

Theory & Applications of Graphs

For G a simple, connected graph, a vertex labeling f:V(G) → Z+ is called a radio labeling of G if it satisfies |f(u)-f(v)|≥ diam(G)+1-d(u,v) for all distinct vertices u,v ∈ V(G). The radio number of G is the minimal span over all radio labelings of G. If a bijective radio labeling onto {1,2,…|V(G)|} exists, G is called a radio graceful graph. We determine the radio number of all diameter 3 Hamming graphs and show that an infinite subset of them is radio graceful.

On The Integer-Antimagic Spectra Of Non-Hamiltonian Graphs, Wai Chee Shiu, Richard M. Low

Theory & Applications of Graphs

Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic if there exists an edge labeling f: E(G) → A \ {0} such that the induced vertex labeling f+: V(G) → A, defined by f+(v) = Σ {f(u,v): (u, v) ∈ E(G)}, is a one-to-one map. In this paper, we analyze the group-antimagic property for Cartesian products, hexagonal nets and theta graphs.

Restrained Reinforcement Number In Graphs, Kazhal Haghparast, Jafar Amjadi, Mustapha Chellali, Seyed Mahmoud Sheikholeslami

Theory & Applications of Graphs

A set S of vertices is a restrained dominating set of a graph G=(V,E) if every vertex in V\ S has a neighbor in S and a neighbor in V\S. The minimum cardinality of a restrained dominating set is the restrained domination number γ_r(G). In this paper we initiate the study of the restrained reinforcement number r_r(G) of a graph G defined as the cardinality of a smallest set of edges F ⊆ E( ‾G) for which γ_r(G + F) < γ_r(G), where ‾G denotes the complement graph of G. …

Respiratory, Neurological And Other Health Outcomes Among Plastic Factory Workers In Gazipur, Bangladesh, Shobhan Das, Md. Masudur Rahman, Asmaul Husna, Margia Akter, Md. Matiur Rahaman, Md. Taohidul Islam, Md. Jamal Uddin, Atin Adhikari

Biostatistics, Epidemiology & Environmental Health Sciences: Faculty Publications

Background: Approximately three thousand plastic goods manufacturing factories (PGMF) are currently operating in Bangladesh involving numerous workers. Associated health problems of these workers are largely unknown. The key objectives of the current study were identifying plastic chemical exposures related health outcomes in these workers and comparing these outcomes before and after their joining in PGMFs. In addition, we aimed to investigate the relationships between work duration and the prevalence of health ailments among workers.

Method: A cross-sectional study was carried out among factory workers (n=405) at six PGMFs in Gazipur district in Bangladesh. A simple random sampling method had been …

On P-Competition Graphs Of Loopless Hamiltonian Digraphs Without Symmetric Arcs And Graph Operations, Kuniharu Yokomura, Morimasa Tsuchiya

Theory & Applications of Graphs

For a digraph D, the p-competition graph C_p(D) of D is the graph satisfying the following: V(C_p(D))=V(D), for x,y ∈ V(C_p(D)), xy ∈ E(C_p(D)) if and only if there exist distinct p vertices v₁, v₂, ..., v_p ∈ V(D) such that x → v_i, y → v_i ∈ A(D) for each i=1,2, ..., p.

We show the H₁ ∪ H₂ is a p-competition graph of a loopless digraph without symmetric arcs for p ≥ 2 , where …

Harmonious Labelings Via Cosets And Subcosets, Jared L. Painter, Holleigh C. Landers, Walker M. Mattox

Theory & Applications of Graphs

In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is harmonious, and that certain starlike trees are harmonious using properties of cosets for a particular subgroup of the integers modulo m, where m is the number of edges of the graph. We expand upon these results by first exploring the numerical properties when adding values from cosets and subcosets in the integers modulo m. …

On The Total Set Chromatic Number Of Graphs, Mark Anthony C. Tolentino, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz

Theory & Applications of Graphs

Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χ_s(G) of a graph G is the minimum number of colors required in a set coloring of G. In this work, we investigate a total analog of set colorings; that is, we study set colorings of the total graph of graphs. Given a graph G = (V, E) …

Total Colouring Of New Classes Of Subcubic Graphs, Sethuraman G, Velankanni Anthonymuthu

Theory & Applications of Graphs

The total chromatic number of a graph G, denoted χ”(G), is the least number of colours needed to colour the vertices and the edges of G such that no incident or adjacent elements (vertices or edges) receive the same colour. The popular Total Colouring Conjecture (TCC) posed by Behzad states that, for every simple graph G, χ”(G) ≤ Δ(G)+2. In this paper, we prove that the total chromatic number for a family of subcubic graphs called cube connected paths and also for a class of subcubic graphs having the property that the vertices are covered by independent …

Geodesic Bipancyclicity Of The Cartesian Product Of Graphs, Amruta V. Shinde, Y.M. Borse

Theory & Applications of Graphs

A cycle containing a shortest path between two vertices u and v in a graph G is called a (u,v)-geodesic cycle. A connected graph G is geodesic 2-bipancyclic, if every pair of vertices u,v of it is contained in a (u,v)-geodesic cycle of length l for each even integer l satisfying 2d + 2 ≤ l ≤ |V(G)|, where d is the distance between u and v. In this paper, we prove that the Cartesian product of two geodesic hamiltonian graphs is a geodesic 2-bipancyclic graph. As a consequence, we show that for n …

Points Of Pride, Georgia Southern University

Points of Pride (2013-2023)

• Rankings
• Academics
• Athletics
• Facilities
• Outreach
• Research

State Of The Methods: Leveraging Design Possibilities Of Qualitatively Oriented Mixed Methods Research, Cheryl N. Poth, Peggy Shannon-Baker

Curriculum, Foundations & Reading: Faculty Publications

No abstract provided.

Retirement Decisions Under Certainty And Uncertainty, Henry J. Guithues, Suk H. Kim, Ronald Hutchins

Southern Business Review (Archived)

Henry J . Guithues is Professor of Finance at St. Louis University. Suk H. Kim is an Associate Professor of Accounting and Finance, University of Detroit. Ronald Hutchins is a faculty member in the Department of Finance, Eastern Michigan University, Ypsilanti, Michigan.

Adam Smith As A Moral Philiosopher, Douglas Y. Thorson

Southern Business Review (Archived)

Dr. Thorson is Professor of Economics at Bradley University, Peoria, lllinois.

Probabilistic Common Stock Analysis, Edward J. Farragher

Southern Business Review (Archived)

Edward J . Farragher is an Associate Professor of Finance, Department of Accounting and Finance, University of Detroit.

Has The Truth-In-Lending Act Worked?, Suk H. Kim, Henry J. Guithues

Southern Business Review (Archived)

Dr. Kim is a faculty member of the College of Business and Administration at the University of Detroit. Dr. Guithues is Professor of Finance at St. Louis University.

Capital Rationing And Binary Integer Programming For Investment Projects Abroad, Suk H. Kim, Edward J. Farragher

Southern Business Review (Archived)

Suk H. Kim is an Assistant Professor and Edward J. Farragher is Chairman of the Department of Accounting and Finance in the College of Business and Administration at the University of Detroit, Detroit, Michigan.

Forecasting In The Small Business, Jospeh A. Giacalone

Southern Business Review (Archived)

Dr. Giacalone is an Associate Dean and Associate Professor of Economics in the College of Business, Administration at St. John's University, Jamaica, New York.

Risk, Security, Insurance, And The Cost Of Protection*, Dale O. Cloninger

Southern Business Review (Archived)

Dale O. Cloninger is an Associate Professor of Finance and Public Affairs at the University of Houston at Clear Lake City.

Computer Applications In Georgia Manufacturing Firms, Leo G. Parrish Jr., Harrison S. Carter

Southern Business Review (Archived)

Dr. Parrish is an Associate Professor and Acting Head of the Department of Management at Georgia Southern College, Dr. Carter is an Assistant Professor in the Department of Management at Georgia Southern College.

Some Issues In Designing The First Course In Quantitative Methods For Business Programs, Raj Aggarwal

Southern Business Review (Archived)

Dr. Aggarwal is an Associate Professor of Finance at the University of Toledo in Toledo, Ohio.

Variations In Property Tax Assessment Ratios In Georgia, Dennis Tosh

Southern Business Review (Archived)

Dr. Tosh is an Associate Professor of Economics in the School of Business Administration at the University of Baltimore.

Honorary Degrees

Academic Affairs Policies

This policy provides the guidelines and requirements for conferring an honorary degree to any member of the Georgia Southern communities.

Characterization Of Outerplanar Graphs With Equal 2-Domination And Domination Numbers, Naoki Matsumoto

Theory & Applications of Graphs

A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset S ⊆ V(G) is a k-dominating set if each vertex v ∈ V(G) \ S is adjacent to at least k vertices in S. It is known that for any graph G with Δ(G) ≥ k ≥ 2, γ_k(G) ≥ γ(G) + k – 2, and then γk(G) > γ(G) for any k ≥ 3, where γ(G) = γ1(G) is the usual domination number. Thus, it is the most interesting problem to characterize graphs G with …

One-Factorizations Of The Complete Graph $K_{P+1}$ Arising From Parabolas, György Kiss, Nicola Pace, Angelo Sonnino

Theory & Applications of Graphs

There are three types of affine regular polygons in AG(2, q): ellipse, hyperbola and parabola. The first two cases have been investigated in previous papers. In this note, a particular class of geometric one-factorizations of the complete graph Kn arising from parabolas is constructed and described in full detail. With the support of computer aided investigation, it is also conjectured that up to isomorphisms this is the only one-factorization where each one-factor is either represented by a line or a parabola.

Pricing Theory Revisited: The Small Business Or "Peripheral" Market, John H. Jackson, Donald E. Vinson

Southern Business Review (Archived)

Dr. Jackson is an Assistant P rofessor of Business at t he Univer sily of Wyoming. Dr. Vinson is an As istant P rofessor of Mar keting at Louisiana State University.

Quantitative Analysis: Its Importance For The Undergraduate Business Student, Leo G. Parrish Jr.

Southern Business Review (Archived)

Commentary

Dr. Parrish is an Associate Professor of Management in the School of Business, Georgia Southern College.

Rainbow Perfect And Near-Perfect Matchings In Complete Graphs With Edges Colored By Circular Distance, Shuhei Saitoh, Naoki Matsumoto, Wei Wu

Theory & Applications of Graphs

Given an edge-colored complete graph K_n on n vertices, a perfect (respectively, near-perfect) matching M in K_n with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors. In this paper, we consider an edge coloring of K_n by circular distance, and we denote the resulting complete graph by K^●_n. We show that when K^●_n has an even number of vertices, it contains a rainbow perfect matching if and only if n=8k or n=8k+2, where k is a nonnegative integer. In the case of an odd …

Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov

Theory & Applications of Graphs

Let (X, d) be a semimetric space and let G be a graph. We say that G is the diametrical graph of (X, d) if X is the vertex set of G and the adjacency of vertices x and y is equivalent to the equality diam X = d(x, y). It is shown that a semimetric space (X, d) with diameter d* is ultrametric if the diametrical graph of (X, d _ε) with d _ε (x, y) = min{d(x, y), ε} is complete multipartite for every ε ∈ (0, d* …