Results 51 to 60 of about 709,702 (295)

Classes of graphs with restricted interval models [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 1999
We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs.
Andrzej Proskurowski, Jan Arne Telle
doaj   +2 more sources

The center of an infinite graph

open access: yesDiscrete Mathematics, 1996
In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite graph and we prove that any infinite graph with at ...
Boza Prieto, Luis   +2 more
openaire   +5 more sources

On the Turán Properties of Infinite Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2008
Let $G^{(\infty)}$ be an infinite graph with the vertex set corresponding to the set of positive integers ${\Bbb N}$. Denote by $G^{(l)}$ a subgraph of $G^{(\infty)}$ which is spanned by the vertices $\{1,\dots,l\}$. As a possible extension of Turán's theorem to infinite graphs, in this paper we will examine how large $\liminf_{l\rightarrow \infty} {|
Andrzej Dudek, Vojtech Rödl
openaire   +3 more sources

Arithmetically maximal independent sets in infinite graphs [PDF]

open access: yes, 2005
Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed.
Bylka, Stanisław
core   +1 more source

Characterizations of the Family of All Generalized Line Graphs—Finite and Infinite—and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj   +1 more source

The hyperbolicity constant of infinite circulant graphs

open access: yesOpen Mathematics, 2017
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj   +1 more source

Eternal domination and clique covering

open access: yesElectronic Journal of Graph Theory and Applications, 2022
We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray   +2 more
doaj   +1 more source

On the girth of infinite graphs

open access: yesDiscrete Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Biophysical approaches for studying viral entry

open access: yesFEBS Letters, EarlyView.
Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley   +1 more source

A sampling theory for infinite weighted graphs [PDF]

open access: yesOpuscula Mathematica, 2011
We prove two sampling theorems for infinite (countable discrete) weighted graphs \(G\); one example being "large grids of resistors" i.e., networks and systems of resistors.
Palle E. T. Jorgensen
doaj   +1 more source

Home - About - Disclaimer - Privacy