Results 231 to 240 of about 39,296 (257)
Social polarization promoted by sparse higher-order interactions. [PDF]
Commun PhysPérez-Martínez H +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Czechoslovak Mathematical Journal, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chartrand, Gary, Zhang, Ping
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chartrand, Gary, Zhang, Ping
openaire +1 more source
Star Extremal Circulant Graphs
SIAM Journal on Discrete Mathematics, 1999A graph is said to be star extremal if its fractional chromatic number is equal to its circular chromatic number. In this paper, it is proven that some families of circulant graphs are star extremal. The results generalize some earlier results obtained by \textit{A. F. Sidorenko} [Discrete Math.
Lih, Ko-Wei +2 more
openaire +1 more source
Extreme-Support Total Monophonic Graphs
Bulletin of the Iranian Mathematical Society, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kathiresan Ganesamoorthy +2 more
openaire +2 more sources
Discrete Mathematics, Algorithms and Applications, 2012
For a connected graph G of order p ≥ 2 and a set W ⊆ V(G), a tree T contained in G is a Steiner tree with respect to W if T is a tree of minimum order with W ⊆ V(T). The set S(W) consists of all vertices in G that lie on some Steiner tree with respect to W. The set W is a Steiner set for G if S(W) = V(G).
openaire +1 more source
For a connected graph G of order p ≥ 2 and a set W ⊆ V(G), a tree T contained in G is a Steiner tree with respect to W if T is a tree of minimum order with W ⊆ V(T). The set S(W) consists of all vertices in G that lie on some Steiner tree with respect to W. The set W is a Steiner set for G if S(W) = V(G).
openaire +1 more source
Extremal Graphs for Homomorphisms II
Journal of Graph Theory, 2013AbstractExtremal problems for graph homomorphisms have recently become a topic of much research. Let denote the number of homomorphisms from G to H. A natural set of problems arises when we fix an image graph H and determine which graph(s) G on n vertices and m edges maximize .
Cutler, Jonathan, Radcliffe, A. J.
openaire +2 more sources
Characterizations of Strength Extremal Graphs
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gu, Xiaofeng +3 more
openaire +2 more sources
Extremal subgraphs of random graphs
Random Structures & Algorithms, 2012AbstractWe prove that there is a constant c > 0, such that whenever p ≥ n‐c, with probability tending to 1 when n goes to infinity, every maximum triangle‐free subgraph of the random graph Gn,p is bipartite. This answers a question of Babai, Simonovits and Spencer (Babai et al., J Graph Theory 14 (1990) 599–622).
Brightwell, G. +2 more
openaire +3 more sources
2020
A graph is called singular if its adjacency matrix is singular. The problem of characterizing all singular graphs was posed in 1957 by L. Collatz and U. Sinogowitz. Since then, it has been studied intensely due to its great importance in mathematics and in chemistry.
openaire +1 more source
A graph is called singular if its adjacency matrix is singular. The problem of characterizing all singular graphs was posed in 1957 by L. Collatz and U. Sinogowitz. Since then, it has been studied intensely due to its great importance in mathematics and in chemistry.
openaire +1 more source