Discrete Mathematics and Combinatorics Commons^™

Induced Subgraph Saturated Graphs, Craig M. Tennenhouse

Theory & Applications of Graphs

A graph G is said to be H-saturated if G contains no subgraph isomorphic to H but the addition of any edge between non-adjacent vertices in G creates one. While induced subgraphs are often studied in the extremal case with regard to the removal of edges, we extend saturation to induced subgraphs. We say that G is induced H-saturated if G contains no induced subgraph isomorphic to H and the addition of any edge to G results in an induced copy of H. We demonstrate constructively that there are non-trivial examples of saturated graphs for …

On Minimum Spanning Subgraphs Of Graphs With Proper Connection Number 2, Zhenming Bi, Gary Chartrand, Garry L. Johns, Ping Zhang

Theory & Applications of Graphs

An edge coloring of a connected graph G is a proper-path coloring if every two vertices of G are connected by a properly colored path. The minimum number of colors required of a proper-path coloring of G is called the proper connection number pc(G) of G. For a connected graph G with proper connection number 2, the minimum size of a connected spanning subgraph H of G with pc(H) = 2 is denoted by μ(G). It is shown that if s and t are integers such that t ≥ s + 2 ≥ 5 …

Special Type Of Fixed Points Of Mod Matrix Operators, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce a special type of fixed points using MOD square matrix operators. These special type of fixed points are different from the usual classical fixed points. A study of this is carried out in this book. Several interesting properties are developed in this regard. The notion of these fixed points find many applications in the mathematical models which are dealt systematically by the authors in the forth coming books. These special type of fixed points or special realized limit cycles are always guaranteed as we use only MOD matrices as operators with …

Mod Graphs, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

Zadeh introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. Atanassov introduced the degree of nonmembership/ falsehood (f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of indeterminacy/ neutrality (i) as independent component in 1995 (published in 1998) and defined the neutrosophic set on three components (t, i, f) = (truth, indeterminacy, falsehood): http://fs.gallup.unm.edu/FlorentinSmarandache.htm Etymology. The words “neutrosophy” and “neutrosophic” were coined/ invented by F. Smarandache in his 1998 book. Neutrosophy: A branch of philosophy, introduced by F. Smarandache in 1980, which studies the origin, nature, and scope of neutralities, as well …

Nidus Idearum. Scilogs, I: De Neutrosophia, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this first books of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …

Mathematics For Everything With Combinatorics On Nature – A Report On The Promoter Dr. Linfan Mao Of Mathematical Combinatorics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

The science’s function is realizing the natural world, developing our society in coordination with natural laws and the mathematics provides the quantitative tool and method for solving problems helping with that understanding. Generally, understanding a natural thing by mathematical ways or means to other sciences are respectively establishing mathematical model on typical characters of it with analysis first, and then forecasting its behaviors, and finally, directing human beings for hold on its essence by that model.

New Facets Of The Balanced Minimal Evolution Polytope, Logan Keefe

Williams Honors College, Honors Research Projects

The balanced minimal evolution (BME) polytope arises from the study of phylogenetic trees in biology. It is a geometric structure which has a variant for each natural number n. The main application of this polytope is that we can use linear programming with it in order to determine the most likely phylogenetic tree for a given genetic data set. In this paper, we explore the geometric and combinatorial structure of the BME polytope. Background information will be covered, highlighting some points from previous research, and a new result on the structure of the BME polytope will be given.

Eternal Independent Sets In Graphs, Yair Caro, William F. Klostermeyer

Theory & Applications of Graphs

The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection. In this paper, eternal independent sets are introduced. These are independent sets such that the following can be iterated forever: a vertex in the independent set can be replaced with a neighboring vertex and the resulting set is independent.

Group-Antimagic Labelings Of Multi-Cyclic Graphs, Dan Roberts, Richard M. Low

Theory & Applications of Graphs

Let Α be a non-trivial abelian group. A connected simple graph G = (V, E) is Α-antimagic if there exists an edge labeling f: Ε(G) → A \{0} such that the induced vertex labeling f+: V(G) → Α, defined by f+(v) = Σ{f(u,v): (u, v) ∈ E(G)}, is a one-to-one map. The integer-antimagic spectrum of a graph G is the set IAM(G) = {κ: G is ℤ_k - antimagic and κ ≥ 2}. In this paper, we analyze the integer-antimagic spectra for various classes of multi-cyclic graphs.

Computing Closed Forms For The Convergent Series $\Displaystyle\Sum_{N \In \Mathbb{Z}}\Frac{1}{(N^3+Bn^2+Cn+D)^K}$, Gagandeep K. Virk

Theses and Dissertations (Comprehensive)

In this thesis we discuss the various approaches that will be taken to evaluate and find a finite closed form for the sum $$\sum_{n \in \mathbb{Z}} \frac{1}{(n^3+Bn^2+Cn+D)^k}$$ where $B, C, D \in \mathbb{C}$ and $k$ is a positive integer. We begin this thesis by studying the cubic equations and discussing briefly various methods of finding their roots. Cardano's method (1545) for finding the roots of cubic polynomials is explored in detail as this method is used in later parts of the thesis to make calculations while evaluating the sums. Various tools and techniques from Fourier analysis are reviewed for these …

Wiener Algebra For The Quaternions, Daniel Alpay, Fabrizio Colombo, David P. Kimsey, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

We define and study the counterpart of the Wiener algebra in the quaternionic setting, both for the discrete and continuous case. We prove a Wiener-Lévy type theorem and a factorization theorem. We give applications to Toeplitz and Wiener-Hopf operators.

The Spectral Theorem For Unitary Operators Based On The S-Spectrum, Daniel Alpay, Fabrizio Colombo, David P. Kimsey, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

The quaternionic spectral theorem has already been considered in the literature, see e.g. [22], [31], [32], however, except for the finite dimensional case in which the notion of spectrum is associated to an eigenvalue problem, see [21], it is not specified which notion of spectrum underlies the theorem.

In this paper we prove the quaternionic spectral theorem for unitary operators using the S-spectrum. In the case of quaternionic matrices, the S-spectrum coincides with the right-spectrum and so our result recovers the well known theorem for matrices. The notion of S-spectrum is relatively new, see [17], and has been used for …

An Edge-Swap Heuristic For Finding Dense Spanning Trees, Mustafa Ozen, Hua Wang, Kai Wang, Demet Yalman

Theory & Applications of Graphs

Finding spanning trees under various restrictions has been an interesting question to researchers. A "dense" tree, from a graph theoretical point of view, has small total distances between vertices and large number of substructures. In this note, the "density" of a spanning tree is conveniently measured by the weight of a tree (defined as the sum of products of adjacent vertex degrees). By utilizing established conditions and relations between trees with the minimum total distance or maximum number of sub-trees, an edge-swap heuristic for generating "dense" spanning trees is presented. Computational results are presented for randomly generated graphs and specific …

An Extremal Problem For Finite Lattices, John Goldwasser, Brendan Nagle, Andres Saez

Theory & Applications of Graphs

For a fixed M x N integer lattice L(M,N), we consider the maximum size of a subset A of L(M,N) which contains no squares of prescribed side lengths k(1),...,k(t). We denote this size by ex(L(M,N), {k(1),...,k(t)}), and when t = 1, we abbreviate this parameter to ex(L(M,N), k), where k = k(1).

Our first result gives an exact formula for ex(L( …

Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory

College of Graduate Studies: Theses & Dissertations

Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an 8-cycle for all positive integers.

The H∞ Functional Calculus Based On The S-Spectrum For Quaternionic Operators And For N-Tuples Of Noncommuting Operators, Daniel Alpay, Fabrizio Colombo, Tao Qian, Irene Sabadini, Tao Qian

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we extend the H∞ functional calculus to quaternionic operators and to n-tuples of noncommuting operators using the theory of slice hyperholomorphic functions and the associated functional calculus, called S-functional calculus. The S-functional calculus has two versions one for quaternionic-valued functions and one for Clifford algebra-valued functions and can be considered the Riesz-Dunford functional calculus based on slice hyperholomorphicity because it shares with it the most important properties.

The S-functional calculus is based on the notion of S-spectrum which, in the case of quaternionic normal operators on a Hilbert space, is also the notion of spectrum that appears …

A New Realization Of Rational Functions, With Applications To Linear Combination Interpolation, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz, Dan Volok

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce the following linear combination interpolation problem (LCI): Given N distinct numbers w1,…wN and N+1 complex numbers a1,…,aN and c, find all functions f(z) analytic in a simply connected set (depending on f) containing the points w1,…,wN such that ∑u=1Nauf(wu)=c. To this end we prove a representation theorem for such functions f in terms of an associated polynomial p(z). We first introduce the following two operations, (i) substitution of p, and (ii) multiplication by monomials zj,0≤j

A Class Of Graphs Approaching Vizing's Conjecture, Aziz Contractor, Elliot Krop

Theory & Applications of Graphs

For any graph G=(V,E), a subset S ⊆ V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). In 1963, V.G. Vizing conjectured that γ(G □ H) ≥ γ(G)γ(H) where □ stands for the Cartesian product of graphs. In this note, we define classes of graphs Α_n, for n≥0, so that every graph belongs to some such class, and Α₀ corresponds to class A of Bartsalkin and German. We prove that …

Towards A Theory Of Recursive Function Complexity: Sigma Matrices And Inverse Complexity Measures, Bradford M. Fournier

LSU New Orleans Theses and Dissertations

This paper develops a data structure based on preimage sets of functions on a finite set. This structure, called the sigma matrix, is shown to be particularly well-suited for exploring the structural characteristics of recursive functions relevant to investigations of complexity. The matrix is easy to compute by hand, defined for any finite function, reflects intrinsic properties of its generating function, and the map taking functions to sigma matrices admits a simple polynomial-time algorithm . Finally, we develop a flexible measure of preimage complexity using the aforementioned matrix. This measure naturally partitions all functions on a finite set by characteristics …

Independent Monopoly Size In Graphs, Ahmed M. Naji, N. D. Soner

Applications and Applied Mathematics: An International Journal (AAM)

In a graph G = (V;E), a set D ⊆V (G) is said to be a monopoly set of G if every vertex v ∈V-D has at least d(v)/ 2 neighbors in D. The monopoly size of G, denoted mo(G), is the minimum cardinality of a monopoly set among all monopoly sets in G. The set D ⊆ V (G) is an independent monopoly set in G if it is both a monopoly set and an independent set in G. The number of vertices in a minimum independent monopoly set in a graph G is the independent monopoly size of …