Results 61 to 70 of about 2,078,525 (187)
, 2015 This book is based on Graph Theory courses taught by P.A. Petrosyan, V.V. Mkrtchyan and R.R. Kamalian at Yerevan State University.
Petrosyan, Petros A. +2 more
openaire +3 more sources
Effective lambda-models vs recursively enumerable lambda-theories [PDF]
, 2008 A longstanding open problem is whether there exists a non syntactical model of the untyped lambda-calculus whose theory is exactly the least lambda-theory (l-beta).
Berline, Chantal +2 more
core +2 more sources
, 1999 Note: Professor Pach's number: [172]; 2nd edition Reference DCG-CHAPTER-2008-027 Record created on 2008-11-18, modified on 2017-05 ...
openaire +4 more sources
The Gewirtz Graph: An Exercise in the Theory of Graph Spectra [PDF]
European Journal of Combinatorics, 1993 AbstractWe prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its structure. It turns out that, e.g., the Coxeter graph (on 28 vertices) and the Sylvester graph (on 36 vertices) are induced subgraphs. We give descriptions of this graph.
Brouwer, A.E., Haemers, W.H.
openaire +3 more sources
On the Edge-Connectivity of an Uncertain Random Graph
IEEE Access, 2020 Connectivity is one of the most important concepts in graph theory. When graph theory is applied to complex systems with indeterminate factors, uncertainty and randomness are two basic types of indeterminacy.
Hao Li, Hui Zhang
doaj +1 more source
Recent progress on graphs with fixed smallest eigenvalue [PDF]
arXiv, 2020 We give a survey on graphs with fixed smallest eigenvalue, especially on graphs with large minimal valency and also on graphs with good structures. Our survey mainly consists of the following two parts: (i) Hoffman graphs, the basic theory related to Hoffman graphs and the applications of Hoffman graphs to graphs with fixed smallest eigenvalue and ...
arxiv
Intersection theory for graphs
Journal of Combinatorial Theory, Series B, 1981 An intersection theory developed by the author for matroids embedded in uniform geometries is applied to the case when the ambient geometry is the lattice of partitions of a finite set so that the matroid is a graph. General embedding theorems when applied to graphs give new interpretations to such invariants as the dichromate of Tutte. A polynomial in
openaire +2 more sources
Construction of industry knowledge graph based on graph theory
大数据, 2023 China has the largest industrial scale and the most abundant industry type among the world.However, due to the influence of many factors, it is necessary to discover the blocking and breakpoints of the industrial chain, identify the stuck points, find ...
Zhenjun LI +6 more
doaj
Journal of Mathematics, 2021 Graph theory has provided a very useful tool, called topological index, which is a number from the graph M with the property that every graph N isomorphic to M value of a topological index must be same for both M and N.
Muhammad Irfan +4 more
doaj +1 more source
Oriented Gain Graphs, Line Graphs and Eigenvalues [PDF]
arXiv, 2015 A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of gain graphs with complex units, matrix properties are established.
arxiv