Results 271 to 280 of about 357,448 (292)
Some of the next articles are maybe not open access.

Topics in Chromatic Graph Theory: Colouring random graphs

, 2015
How many colours are typically necessary to colour a graph? We survey a number of perspectives on this natural question, which is central to random graph theory and to probabilistic and extremal combinatorics. It has stimulated a vibrant area of research,
Ross J. Kang, C. McDiarmid
semanticscholar   +1 more source

Configurations of DNA cages based on plane graphs and vertex junctions

Journal of Physics A: Mathematical and Theoretical, 1965
Surface wave phase velocities for an inhomogeneous medium are usually given as eigenvalues of the wave equation. This is a differential equation (Love waves) or pair of differential equations (Rayleigh waves) of the second order. By means of a change of variable the problem is reducible to finding the zeros of a first‐order differential equation or ...
M. G. Neigauz   +2 more
openaire   +3 more sources

[Most frequent themes in Editorials of Vertex journal (1990-2019) analyzed by graph theory].

Vertex (Buenos Aires, Argentina), 2022
The analysis of Editorials is a little explored topic, which can facilitate the understanding of historical processes and changes in Psychiatry. In the case of de Vertex Revista Argentina de Psiquiatría, the Editorials were written by the same person for 30 years. The most frequently used thematic areas were studied, using graph theory, to characterize
Daniel, Matusevich   +3 more
openaire   +1 more source

Graph Parameters and Ramsey Theory

International Workshop on Combinatorial Algorithms, 2016
Ramsey’s Theorem tells us that there are exactly two minimal hereditary classes containing graphs with arbitrarily many vertices: the class of complete graphs and the class of edgeless graphs.
V. Lozin
semanticscholar   +1 more source

Chemical Graph Theory

, 1992
INTRODUCTION. ELEMENTS OF GRAPH THEORY. The Definition of a Graph. Isomorphic Graphs and Graph Automorphism. Walks, Trails, Paths, Distances and Valencies in Graphs. Subgraphs. Regular Graphs. Trees. Planar Graphs.
N. Trinajstic
semanticscholar   +1 more source

On the Shannon capacity of a graph

IEEE Transactions on Information Theory, 1979
It is proved that the Shannon zero-error capacity of the pentagon is \sqrt{5} . The method is then generalized to obtain upper bounds on the capacity of an arbitrary graph.
L. Lovász
semanticscholar   +1 more source

Iwasawa theory for vertex-weighted graphs

29 pages, 8 ...
Murooka, Ryosuke, Tateno, Sohei
openaire   +1 more source

A fuzzy irregular cellular automata-based method for the vertex colouring problem

Connection science, 2019
Vertex colouring is among the most important problems in graph theory which has been widely applied across different real-world problems. In vertex colouring problem (VCP), the goal is to assign a distinct colour to each vertex of the graph in such a way
M. Kashani, S. Gorgin, S. V. Shojaedini
semanticscholar   +1 more source

Algebraic Graph Theory: COLOURING PROBLEMS

, 1974
1. Introduction to algebraic graph theory Part I. Linear Algebra in Graphic Thoery: 2. The spectrum of a graph 3. Regular graphs and line graphs 4. Cycles and cuts 5. Spanning trees and associated structures 6. The tree-number 7. Determinant expansions 8.
N. Biggs
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy