Results 11 to 20 of about 11,127 (121)
Extremal Graph Theory for Metric Dimension and Girth [PDF]
, 2012 6 ...
Mohsen Jannesari
openaire +3 more sources
On almost hypohamiltonian graphs [PDF]
Discrete 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
Prime Graph over Cartesian Product over Rings and Its Complement
JTAM (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 +1 more source
Barekeng, 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.
Dewi Santri Ramdani +2 more
doaj +1 more source
The missing Moore graph as an optimization problem
EURO Journal on Computational Optimization, 2023 It has been an open question for 6 decades whether a Moore graph of diameter 2 and degree 57 exists. In this paper the question is posed as an optimization problem and an algorithm is described.
Derek H. Smith, Roberto Montemanni
doaj +1 more source
Equimatchable Bipartite Graphs
Discussiones 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
Parameterization Above a Multiplicative Guarantee [PDF]
, 2020 Parameterization above a guarantee is a successful paradigm in Parameterized Complexity. To the best of our knowledge, all fixed-parameter tractable problems in this paradigm share an additive form defined as follows.
Fomin, Fedor V. +5 more
core +2 more sources
On the Minimum Order of Extremal Graphs to have a Prescribed Girth [PDF]
, 2007 We show that any n‐vertex extremal graph G without cycles of length at most k has girth exactly $k+1$ if $k\ge 6$ and $n>(2(k-2)^{k-2}+k-5)/(k-3)$. This result provides an improvement of the asymptotical known result by Lazebnik and Wang [J. Graph Theory,
Balbuena, C., García Vázquez, Pedro
core +1 more source
Generation of cubic graphs and snarks with large girth [PDF]
, 2017 We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least $k\ge 5$ which are very efficient for $5\le k \le 7$ and show how these algorithms can be efficiently restricted to generate snarks with girth at ...
Brinkmann, Gunnar, Goedgebeur, Jan
core +1 more source
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [PDF]
, 2005 We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding.
Kelley, Christine +2 more
core +4 more sources