Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Georgia Southern University (167)
- Claremont Colleges (123)
- Rose-Hulman Institute of Technology (74)
- University of New Mexico (69)
- Chapman University (61)
-
- East Tennessee State University (56)
- Prairie View A&M University (49)
- University of Kentucky (37)
- Illinois State University (30)
- Marshall University (30)
- University of the Pacific (30)
- University of Richmond (29)
- City University of New York (CUNY) (28)
- Louisiana State University (24)
- University of Nebraska - Lincoln (22)
- Portland State University (19)
- Smith College (19)
- Kutztown University (18)
- West Chester University (18)
- Virginia Commonwealth University (17)
- Western Kentucky University (16)
- California State University, San Bernardino (15)
- Dartmouth College (15)
- Swarthmore College (14)
- Bucknell University (13)
- Western Michigan University (13)
- Michigan Technological University (12)
- San Jose State University (12)
- West Virginia University (12)
- California Polytechnic State University, San Luis Obispo (10)
- Keyword
-
- Graph theory (97)
- Combinatorics (93)
- Mathematics (32)
- Neutrosophic logic (28)
- Graph Theory (27)
-
- Graph (21)
- Graphs (19)
- Domination (18)
- Trees (14)
- Discrete mathematics (13)
- Fibonacci numbers (13)
- Graph coloring (13)
- Combinatorial analysis (12)
- Probability (12)
- Algebra (11)
- Cryptography (11)
- Digraph (10)
- Generating function (10)
- Connectivity (9)
- Counting (9)
- Matroids (9)
- Number theory (9)
- Permutations (9)
- Difference set (8)
- Difference sets (8)
- Combinatorial identities (7)
- Cycles (7)
- Matroid (7)
- Optimization (7)
- Partitions (7)
- Publication Year
- Publication
-
- Theory & Applications of Graphs (144)
- Branch Mathematics and Statistics Faculty and Staff Publications (68)
- All HMC Faculty Publications and Research (62)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (61)
- Electronic Theses and Dissertations (59)
-
- Applications and Applied Mathematics: An International Journal (AAM) (49)
- HMC Senior Theses (40)
- Rose-Hulman Undergraduate Mathematics Journal (40)
- Theses and Dissertations--Mathematics (34)
- Mathematical Sciences Technical Reports (MSTR) (33)
- Mathematics Faculty Publications (33)
- Department of Math & Statistics Faculty Publications (29)
- Pacific Open Videos (29)
- Annual Symposium on Biomathematics and Ecology Education and Research (28)
- Faculty Publications (24)
- LSU Doctoral Dissertations (23)
- Mathematics Faculty Research (23)
- Theses and Dissertations (20)
- College of Graduate Studies: Theses & Dissertations (18)
- Communications on Number Theory and Combinatorial Theory (17)
- Department of Mathematics: Dissertations, Theses, and Student Research (17)
- Masters Theses & Specialist Projects (16)
- Mathematics & Statistics Faculty Works (14)
- Honors Theses (13)
- Mathematics and Statistics Faculty Publications and Presentations (13)
- Publications and Research (13)
- Dissertations (12)
- Dissertations, Master's Theses and Master's Reports (12)
- Electronic Theses, Projects, and Dissertations (12)
- Graduate Theses, Dissertations, and Problem Reports (ETD) (12)
- Publication Type
- File Type
Articles 91 - 120 of 1326
Full-Text Articles in Mathematics
On Unavoidable Infinite Hypergraphs, Samuel Weiner
On Unavoidable Infinite Hypergraphs, Samuel Weiner
LSU Doctoral Dissertations
Ramsey's Theorem states that every infinite graph contains either K∞ or $\overline{K∞}$ as an induced subgraph. For this reason, K∞ and $\overline{K∞}$ are often referred to as the unavoidable infinite graphs. Many similar results have characterized the unavoidable members for various classes of infinite graphs; perhaps the most notable of these is König's Infinity Lemma, which states that every infinite, connected, locally finite graph contains a ray as an induced subgraph. From these findings, one can easily deduce that every infinite, connected graph contains an infinite clique, star, or ray as an induced subgraph; …
New View Of Some Propositions On Hesitant Fuzzy Set And Its Application In Selecting The Best Person In Any Job, Manar Mohamed Omran Dr., Arafa A. Nasef A.Dr, Reham Abd El-Aziz Abo Khadra Dr., Mahmoud Arafa Nasef Dr.
New View Of Some Propositions On Hesitant Fuzzy Set And Its Application In Selecting The Best Person In Any Job, Manar Mohamed Omran Dr., Arafa A. Nasef A.Dr, Reham Abd El-Aziz Abo Khadra Dr., Mahmoud Arafa Nasef Dr.
Journal of Engineering Research
An essential part of uncertainty is played by the hesitant fuzzy set (HFS). So, it can be utilized when making decisions. The suggested use of HFS to choose the best candidate for any post is thoroughly discussed and introduces new HFS concepts
Component Order Edge Connectivity, Vertex Degrees, And Integer Partitions, Michael R. Yatauro
Component Order Edge Connectivity, Vertex Degrees, And Integer Partitions, Michael R. Yatauro
Theory & Applications of Graphs
Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1. In general, determining the k-component order edge connectivity of a graph is NP-hard. We identify conditions on the vertex degrees of G that can be used to imply a lower bound on the k-component order edge connectivity of G. We will discuss the process for generating such conditions for a lower bound of 1 or 2, and we …
Induced-Minor-Closed Classes Of Matroids, James Dylan Douthitt
Induced-Minor-Closed Classes Of Matroids, James Dylan Douthitt
LSU Doctoral Dissertations
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of simple GF(q)-representable matroids that can be built from projective geometries over GF(q) by repeated generalized parallel connections across projective geometries. We show that this class of matroids is closed under induced minors and characterize the class by its forbidden induced minors, noting that the case when q=2 is distinctive. Additionally, we show that the class of GF(2)-chordal matroids coincides …
The Intricacies Of Pairwise Modular Multiplicative Inverse In Lucas Numbers, Charles Liu
The Intricacies Of Pairwise Modular Multiplicative Inverse In Lucas Numbers, Charles Liu
Rose-Hulman Undergraduate Mathematics Journal
Let (p,q) be a pair of relatively prime integers greater than 1. The pairwise modular multiplicative inverse (PMMI) of (p,q) is defined as the unique pair of positive integers (p′, q′) such that p p′ ≡ 1 (mod q), p′ < q, qq′ ≡ 1 (mod p), q′ < p. In this paper, we determine all pairs of Lucas numbers such that their PMMIs are pairs of Lucas numbers.
Discrete Math For Computer Science - Chapter 8: Union And Intersection And Complement: Set Identities, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 8: Union And Intersection And Complement: Set Identities, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 15: Mathematical Induction, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 15: Mathematical Induction, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 13: Sequences: Recurrence Relations, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 13: Sequences: Recurrence Relations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 26: Introduction To Graphs: Graph Representations, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 26: Introduction To Graphs: Graph Representations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 2: Logical Equivalence: Laws Of Propositional Logic, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 2: Logical Equivalence: Laws Of Propositional Logic, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 11: Inverse Of A Function: Composition Of Functions, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 11: Inverse Of A Function: Composition Of Functions, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 16: Recursive Definitions: Recursive Algorithms, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 16: Recursive Definitions: Recursive Algorithms, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science, Houman Kamran Habibkhani
Discrete Math For Computer Science, Houman Kamran Habibkhani
Pacific Open Texts
Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students.
Discrete Math For Computer Science - Chapter 4: Logical Reasoning: Rules Of Inference, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 4: Logical Reasoning: Rules Of Inference, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 14: Summations, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 14: Summations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 19: Number Representation, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 19: Number Representation, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 27: Paths And Cycles: Graph Connectivity, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 27: Paths And Cycles: Graph Connectivity, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 28: Introduction To Trees: Properties Of Trees, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 28: Introduction To Trees: Properties Of Trees, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 29: Tree Traversals: Spanning Trees, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 29: Tree Traversals: Spanning Trees, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 3: Predicates And Quantifiers: Quantified Statements, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 3: Predicates And Quantifiers: Quantified Statements, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 1: Proposition, Logical Operations, And Conditional Statements, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 1: Proposition, Logical Operations, And Conditional Statements, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 22: Counting By Complement: Permutations With Repetitions: Inclusion/Exclusion Principle, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 22: Counting By Complement: Permutations With Repetitions: Inclusion/Exclusion Principle, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 20: Sum And Product Rules, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 20: Sum And Product Rules, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 25: Conditional Probability And Independence, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 25: Conditional Probability And Independence, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 24: Unions And Complements Of Events, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 24: Unions And Complements Of Events, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 17: The Division Algorithm: Modular Arithmetic, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 17: The Division Algorithm: Modular Arithmetic, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 23: Probability Of An Event, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 23: Probability Of An Event, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 12: Introduction To Binary Relations, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 12: Introduction To Binary Relations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 21: Counting Permutations And Subsets, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 21: Counting Permutations And Subsets, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 18: Prime Factorization: Gcd And Euclid’S Algorithm, Houman Kamran Habibkhani
Discrete Math For Computer Science - Chapter 18: Prime Factorization: Gcd And Euclid’S Algorithm, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.