We aren't endorsed by this school 
CGTC 40  FAU Study Resources

ManKong
School: FAU
On EdgeBalance Index Sets of Some Complete kpartite Graphs Man Kong , University of Kansas, SinMin Lee, San Jose State University, and YungChin Wang, TzuHui Institute of Technology. Let G be a simple graph with vertex set V (G) and edge set E(G), and

Ingraham,Megan
School: FAU
Coloring of Distance Graphs Megan Ingraham , Hiren Maharaj, Clemson University A long standing problem is to determine the chromatic number of the unit distance graph on the Euclidean plane. The continuing search for bounds on this chromatic number h

Salehi,Ebrahim
School: FAU
PCLabeling of a Graph and its PCSet Ebrahim Salehi, University of Nevada Las Vegas For a graph G = (V, E) and a binary vertex coloring (labeling) f : V (G) {0, 1} let vf (i) = f 1 (i). f is said to be cordial if vf (1) vf (0) 1. The coloring

Feder,Elie
School: FAU
The Maximum Rectilinear Crossing Number of the n Dimensional Cube Graph, Qn Matthew Alpert (Harvard University), Elie Feder* (Kingsborough Community CollegeCUNY), Heiko Harborth (Technische Universitaet) and Sheldon Klein* (Rambam Mesivta High Schoo

Garber,David
School: FAU
The Orchard crossing number of complete bipartite graphs Elie Feder (Kingsborough Community CollegeCUNY, USA), and David Garber* (Holon Institute of Technology, Israel) We continue our research regarding the Orchard crossing number, which is dened i

Shawash
School: FAU
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the (n, k)bubblesort Graphs Eddie Cheng and Nart Shawash , Oakland University, University of Detroit Mercy The (n, k)bubblesort graph is a generalization of the bubblesort graph in a way s

Tanny,Stephen
School: FAU
Graphs and MetaFibonacci Recursions Abraham Isgur, David Reiss and Stephen Tanny*, Department of Mathematics, University of Toronto For k>1 and nonnegative parameters ap, bp, p = 1.k, define the recursion C(n) = C(n ap C(n bp), denoted in short b

Jamison,Robert
School: FAU
Small Chords in Mix Graphs Robert E. Jamison, Clemson University Many graph classes can be described using roughly the following paradigm: each vertex is assigned something measuring its size and something measuring its tolerance. If the combined siz

Jum,Ernest
School: FAU
Independent Domination in Complementary Prisms Ernest Jum , Joel A. Gngora, Teresa W. Haynes o Department of Mathematics East Tennessee State University Johnson City, TN 376140002 USA Let G be a graph and G be the complement of G. The complementary

Wang,YoungChin
School: FAU
On Balance Index Sets of Disjoint Union Graphs SinMin Lee, San Jose State University, HsinHao Su, Stonehill College, and YungChin Wang , TzuHui Institute of Technology, Taiwan. Let G be a simple graph with vertex set V (G) and edge set E(G), and

Lee,Andrew
School: FAU
On Balance Index Sets of Generalized Friendship Graphs Andrew ChungYeung Lee , Syracuse University, SinMin Lee, San Jose State University and HsinHao Su, Stonehill College. Let G=(V (G), E(G) be a nite simple graph, A = {0, 1} and f be a vertex la

Mckee
School: FAU
Hereditarily Equivalent Graph Properties Terry McKee, Wright State University For any graph property P , dene a graph to be hereditarilyP if every induced subgraph satises P . Dene two graph properties P and Q to be hereditarily equivalent if being

Novik,Beth
School: FAU
Independent Sets in Edge Closures of BondyChvtal Type a Robert E. Jamison, Beth Novick Clemson University Let Kn be the complete graph of order n and a positive integral threshold. Suppose S is a set of edges of Kn and let degS (v) denote the numbe

Isaak,Garth
School: FAU
Monotone Reachability with Short Paths Jonelle Hook, Garth Isaak , Lehigh University If we 3 color the arcs of any nite tournament can we nd a sink set of 3 vertices such that there is a monochromatic path from every vertex into the set? This is a sp

Chopra,Low,Dios
School: FAU
Some Inequalities on the Existence of Some Balanced Arrays. D.V. Chopra, Dept. of Mathematics and Statistics, Wichita State University, Wichita, KS 672600033, USA. dharam.chopra@wichita.edu R.M. Low, Dept. of Mathematics, San Jose State University,

Vaughan,Emil
School: FAU
Hall's condition for partial latin squares A. J. W. Hilton and E. R. Vaughan , Queen Mary, University of London A partial latin square completion problem can be naturally expressed as a graph listcoloring problem. A necessary condition for a listco

Zhang,Ping
School: FAU
Title: From Checkerboards to Graph Colorings Authors: Gary Chartrand, Western Michigan University, Futaba Okamoto, University of Wisconsin  La Crosse, Ebrahim Salehi, University of Nevada Las Vegas, Ping Zhang , Western Michigan University. A checke

Froncek,Dalibor
School: FAU
CYCLIC DECOMPOSITIONS OF COMPLETE GRAPHS INTO Km,n + e : THE MISSING CASE Dalibor Froncek University of Minnesota Duluth A graph G is called almost bipartite if there exists an edge e that G  e is bipartite. E(G) such In 2004, A. Blinco, S. El

Starling,Greg
School: FAU
The TimeComplexity of Shear Sort Greg Starling , Gordon Beavers, University of Arkansas Shear Sort is a parallel algorithm for sorting m n numbers. Without loss of generality we apply it to elements of Smn . Shear Sort arranges a permutation of Smn

Lee,JungYeun
School: FAU
The competition number of a graph G with exactly one maximal clique of size 3 JungYeun Lee (Seoul National University), SeogJin Kim(Konkuk University) SuhRyung Kim(Seoul National University), Yoshio Sano(Kyoto University) Given a digraph D, its com

Lipman,Drew
School: FAU
Diameter of Star Graphs with many Faults Eddie Cheng, Drew Lipman , Oakland University. An important issue in computer communication networks is faulttolerant routing. Given a graph H and a set of faults F V (H) such that H F is connected, a routi

Nelson,Roger
School: FAU
Guideposts in the Cyclic Towers of Hanoi Problem John W. Emert Roger B. Nelson* Ball State University Frank W. Owens The multiple towers of Hanoi puzzle with a directed cycle transition graph is a variation of the classic 3post towers of Hanoi puzz

Laskar,Renu
School: FAU
Role Assignments and Domination in Graphs Renu Laskar , Clemson University and Jeremy Lyle, University of Southern Mississippi In this paper we investigate the concept of role assignments as a tool for considering vertex partitions of a graph where e

Worley,George
School: FAU
Finding an Approximate Minimum Defensive Alliance G Gordon Worley III , University of Central Florida Given a simple graph G = (V, E), a defensive alliance S V is a set of vertices with the property that for every v S, N [v] S N (v) (V S).

Hartnell,Bert
School: FAU
Uniformly klimited packings Bert Hartnell, Saint Marys University, Canada A klimited packing in a graph, which generalizes a packing in a graph, is a set of vertices S such that no vertex in the graph has more than k members of S in its closed neig

Schiermeyer,Ingo
School: FAU
Approximation algorithms for the minimum rainbow subgraph problem Stephan Matos Camacho, Ingo Schiermeyer , Zsolt Tuza, Technische Universitt Bergakademie Freiberg, Germany a We consider the Minimum Rainbow Subgraph problem (MRS): Given a graph G, wh

Toma,Susan
School: FAU
On the system of multiple all different predicates Serge Kruk, Susan Toma , Oakland University In this paper, we explore the properties of the comb structure of the multiple all different predicates by presenting two classes of facetinducing inequal

Kubicki,Grzegorz
School: FAU
Graphtheoretic generalization of the secretary problem; selecting a best twin Grzegorz Kubicki , University of Louisville Michal Morayne, Wroclaw University of Technology Consider a poset P consisting of two chains of the same length; the only uncom

Light,John
School: FAU
Lowdimensional Cross Comparison Graphs Neil J. Calkin, Robert E. Jamison, J. Bowman Light , Clemson University A cross comparison graph model is one in which each vertex v is assigned a rank rv and a tolerance tv (both from some partially ordered se

Shahrokhi,Farhad
School: FAU
A new look at the tree decomposition Farhad Shahrokhi, UNT, farhad@cs.unt.edu Let G = (V, E) be a graph. We present new algorithms for computing a maximum independent set of G based on a variation of the tree decomposition method. The classical algor

Roberts,Charles
School: FAU
RungeKuttaFehlberg Integration Methods of the NewtonCotes Type Charles E. Roberts, Jr., Indiana State University We develop a fourthorder and a fifthorder RungeKuttaFehlberg numerical integration procedure of the NewtonCotes type which have s

Jobby,Jacob
School: FAU
Minimal Rankings of Certain Classes of Graphs Jobby Jacob and Renu Laskar, Clemson University, Dan Pillone, Patumwan School and Gilbert Eyabi, Anderson University For a graph G = (V, G), a function f : V (G) {1, 2, . . . , k} is a kranking if f (u)

Chan,Shiu,Low,Wan
School: FAU
On a Coinflipping Problem. W.H. Chan, Dept. of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, China. dchan@hkbu.edu.hk W.C. Shiu, Dept. of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, China. wcshiu@hkbu.ed

Voigt,Margit
School: FAU
A special list coloring problem Margit Voigt, University of Applied Sciences Dresden, Germany A list assignment L of G is a function that assigns to every vertex v of G a set (list) L(v) of colors. The graph G is called Llist colorable if there is a

Hochberg,Rob
School: FAU
Discrepancy of Homogeneous Arithmetic Progressions Robert Hochberg, East Carolina University In the 1930s, Paul Erds asked if there was some constant B and a 2coloring of the natural o numbers so that every finite arithmetic progression containing z

Matheis
School: FAU
Some Remarks and Problems on Matrix Enumeration Shanzhen Gao, Kenneth Matheis*, Floridada Atlantic University, The enumeration of Integermatrices has been the subject of considerable study, and it is unlikely that simple formulas exist except for so

Kemnitz,Anfried
School: FAU
dStrong Edge Colorings of Graphs Arnfried Kemnitz , Massimiliano Marangio, Techn. Univ. Braunschweig, Germany If c : E {1, 2, . . . , k} is a proper edge coloring of a graph G = (V, E) then the palette S(v) of a vertex v V is the set of colors of

Slater,Peter
School: FAU
Defining Parameters for Countably Infinite Graphs Peter J. Slater, University of Alabama in Huntsville Because one can tile the infinite square grid Z Z that is regular of degree four with stars K1,4 , it seems reasonable to define the domination pe

Seo,SukJai
School: FAU
CompetitionIndependence Number of Special Classes of Graphs Suk Jai Seo*, Middle Tennessee State University Peter J. Slater, University of Alabama in Huntsville Consider a game associated with a graph G = (V,E) involving two players (maximizer and m

Gray,Daniel
School: FAU
Randi Index and Extremal Cacti c Daniel Gray , Hua Wang, Georgia Southern University A cactus is a connected graph with each block being an edge or a cycle. The Randi index of c a graph G is the sum of (d(u)(d(v) over all edges uv of G, where d(v) d

Radziszowski
School: FAU
Bounds on Some Ramsey Numbers Involving Quadrilateral Xiaodong Xu, Guangxi Academy of Sciences, Nanning, China Zehui Shao, Huazhong University of Science and Technology, Wuhan, China Stanislaw Radziszowski , Rochester Institute of Technology, NY, USA