Results 1 to 10 of about 789,035 (73)

Prime Graph over Cartesian Product over Rings and Its Complement [PDF]

open access: yesJTAM (Jurnal Teori dan Aplikasi Matematika), 2023
Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc.
Farah Maulidya Fatimah   +2 more
doaj   +3 more sources

On almost hypohamiltonian graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj   +6 more sources

Equimatchable Bipartite Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2023
A graph is called equimatchable if all of its maximal matchings have the same size. Lesk et al. [Equi-matchable graphs, Graph Theory and Combinatorics (Academic Press, London, 1984) 239–254] has provided a characterization of equimatchable bipartite ...
Büyükçolak Yasemin   +2 more
doaj   +1 more source

Locally common graphs

open access: yesJournal of Graph Theory, Volume 102, Issue 3, Page 472-483, March 2023., 2023
Abstract Goodman proved that the sum of the number of triangles in a graph on n n nodes and its complement is at least n3∕24 Endre Csóka   +2 more
wiley   +1 more source

Single‐conflict colorings of degenerate graphs

open access: yesJournal of Graph Theory, EarlyView., 2023
Abstract We consider the single‐conflict coloring problem, a graph coloring problem in which each edge of a graph receives a forbidden ordered color pair. The task is to find a vertex coloring such that no two adjacent vertices receive a pair of colors forbidden at an edge joining them.
Peter Bradshaw, Tomáš Masařík
wiley   +1 more source

Effects of low‐dust forages on dust exposure, airway cytology, and plasma omega‐3 concentrations in Thoroughbred racehorses: A randomized clinical trial

open access: yesJournal of Veterinary Internal Medicine, Volume 37, Issue 1, Page 338-348, January/February 2023., 2023
Abstract Background Racehorses commonly develop evidence of mild asthma in response to dust exposure. Diets deficient in omega‐3 polyunsaturated fatty acids (Ω‐3) might exacerbate this response. Hypothesis To compare dust exposure, bronchoalveolar lavage fluid (BALF) cytology, and plasma Ω‐3 and specialized pro‐resolving mediators (SPM) concentrations ...
Carla J. Olave   +5 more
wiley   +1 more source

THE INTERSECTION GRAPH REPRESENTATION OF A DIHEDRAL GROUP WITH PRIME ORDER AND ITS NUMERICAL INVARIANTS [PDF]

open access: yes, 2022
One of the concepts in mathematics that developing rapidly today is Graph Theory. The development of Graph Theory has been combined with Group Theory, that is by representing a group in a graph.
Awanis, Zatta Yumni   +2 more
core   +2 more sources

On the limitations of the use of solvable groups in Cayley graph cage constructions [PDF]

open access: yes, 2010
A (k,g)-cage is a (connected) k-regular graph of girth g having smallest possible order. While many of the best known constructions of small k-regular graphs of girth g are known to be Cayley graphs, there appears to be no general theory of the ...
Conder, Marston   +2 more
core   +1 more source

Design of High-Rate LDPC Codes Based on Matroid Theory [PDF]

open access: yes, 2019
In this letter, sufficient conditions for the determination of the girth are studied from the perspective of matroid theory. The girth of a Tanner graph is at least $2(t_{1}+2)$ if $t_{1}$ specific conditions are simultaneously met.
He, Jiguang, Lv, Yijie, Wu, Guangfu
core   +1 more source

Home - About - Disclaimer - Privacy