Results 131 to 140 of about 1,017,247 (314)
Hitting Times in the Binomial Random Graph
Journal of Graph Theory, EarlyView.ABSTRACT Fix k ≥ 2 $k\ge 2$, choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) $\frac{\mathrm{log}n}{{n}^{(k-1)\unicode{x02215}k}}\le p\le 1-{\rm{\Omega }}(\frac{{\mathrm{log}}^{4}n}{n})$, and consider G ~ G ( n , p ) $G\unicode{x0007E}G(n,p)$. For any pair of vertices v , w ∈ V ( G ) $v,w\in V(G)$, we give a simple and precise formula for the ...
Bertille Granet +2 more
wiley +1 more source
On balanced bipartitions of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Bollobás and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each for each In this paper, we consider the contrary side and show that every graphic sequence has a realization G which admits a balanced bipartite spanning subgraph H such that for each and we show that the bound is sharp.
openaire +2 more sources
Multiscale Visualization and Exploration of Large Bipartite Graphs
Computer graphics forum (Print), 2018 A bipartite graph is a powerful abstraction for modeling relationships between two collections. Visualizations of bipartite graphs allow users to understand the mutual relationships between the elements in the two collections, e.g., by identifying ...
Nicola Pezzotti +5 more
semanticscholar +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
P 4-Colorings and P 4-Bipartite Graphs
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V i s is said to be a P 4-free coloring if each color class V i induces a subgraph without chordless path on four vertices (denoted by P 4).
Chính T. Hoàng, Van Bang Le
doaj
Complexity of Roman {2}-domination and the double Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Chakradhar Padamutham +1 more
doaj +1 more source
Dense H-free graphs are almost (Χ(H)-1)-partite [PDF]
, 2010 By using the Szemeredi Regularity Lemma, Alon and Sudakov recently extended the classical Andrasfai-Erdos-Sos theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true.
Peter Allen, Allen, Peter
core
Symmetric Bipartite Graphs and Graphs with Loops [PDF]
, 2014 We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges its two parts.
Stacey Mendan +3 more
core +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, EarlyView.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Spectral analogues of Moon–Moser's theorem on Hamilton paths in bipartite graphs [PDF]
, 2016 In 1962, Erdős proved a theorem on the existence of Hamilton cycles in graphs with given minimum degree and number of edges. Significantly strengthening in case of balanced bipartite graphs, Moon and Moser proved a corresponding theorem in 1963.
Binlong Li, Bo Ning
semanticscholar +1 more source