Results 1 to 10 of about 732,643 (255)
The Lovász–Cherkassky theorem in infinite graphs
Transactions of the London Mathematical SocietyInfinite generalizations of theorems in finite combinatorics were initiated by Erdős due to his famous Erdős–Menger conjecture (now known as the Aharoni–Berger theorem) that extends Menger's theorem to infinite graphs in a structural way.
Attila Joó
doaj +2 more sources
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
A Note on Pseudofinite Acyclic Graphs
Известия Иркутского государственного университета: Серия "Математика"Acyclic graphs approximated by finite acyclic graphs are considered. It is proved that any countably categorical acyclic graph is smoothly approximable. An example of pseudofinite acyclic graph theory is given, which has an even, odd, and infinite number
N. D. Markhabatov, Ye. R. Baissalov
doaj +1 more source
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Discussiones Mathematicae Graph Theory, 2014 The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered.
Katona Gyula Y. +2 more
doaj +1 more source
Inertias of Laplacian matrices of weighted signed graphs
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +1 more source
The incidence chromatic number of some graph
International Journal of Mathematics and Mathematical Sciences, 2005 The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj +1 more source
Forbidden four cycle, star graphs and isometric embeddings
Pracì Mìžnarodnogo Geometričnogo CentruWe prove the necessary and sufficient conditions under which ultrametric spaces of arbitrary infinite cardinality admit isometric embeddings into ultrametric spaces generated by labeled star graphs.
Olga Rovenska, Oleksiy Dovgoshey
doaj +1 more source
Shannon Capacity and Related Graph Invariants for Lexicographic Products. [PDF]
Entropy (Basel)Sason I.
europepmc +1 more source
Gromov hyperbolicity of planar graphs
Open Mathematics, 2013 Cantón Alicia +3 more
doaj +1 more source
The Scaling Limit of Random Two-Connected Series-Parallel Maps. [PDF]
J Theor ProbabAmankwah D +4 more
europepmc +1 more source