Results 11 to 20 of about 11,127 (121)
Computing Graph Roots Without Short Cycles [PDF]
, 2009 Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however Motwani and Sudan proved that it is NP-complete to determine if a given ...
Farzad, Babak +3 more
core +3 more sources
Total Domination Versus Paired-Domination in Regular Graphs
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph
Cyman Joanna +4 more
doaj +1 more source
, 2018 Cages, defined as regular graphs with minimum number of nodes for a given girth, are well-studied in graph theory. Trapping sets are graphical structures responsible for error floor of low-density parity-check (LDPC) codes, and are well investigated in ...
Banihashemi, Amir H., Dehghan, Ali
core +1 more source
Lower Bounds for the Cop Number When the Robber is Fast
, 2011 We consider a variant of the Cops and Robbers game where the robber can move t edges at a time, and show that in this variant, the cop number of a d-regular graph with girth larger than 2t+2 is Omega(d^t). By the known upper bounds on the order of cages,
ABBAS MEHRABIAN +5 more
core +1 more source
Triangles and Girth in Disk Graphs and Transmission Graphs [PDF]
, 2019 Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t in S if and only if |st|
Kaplan, Haim +5 more
core +3 more sources
On extremal numbers of the triangle plus the four-cycle
Forum of Mathematics, SigmaFor a family $\mathcal {F}$ of graphs, let ${\mathrm {ex}}(n,\mathcal {F})$ denote the maximum number of edges in an n-vertex graph which contains none of the members of $\mathcal {F}$ as a subgraph.
Jie Ma, Tianchi Yang
doaj +1 more source
A Breezing Proof of the KMW Bound
, 2020 In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum degree $\Delta$
Coupette, Corinna, Lenzen, Christoph
core +1 more source
Some spectral and quasi-spectral characterizations of distance-regular graphs [PDF]
, 2016 © . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/In this paper we consider the concept of preintersection numbers of a graph.
Abiad, Aida +2 more
core +2 more sources
On Almost Well-Covered Graphs of Girth at Least 6
, 2018 We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the difference ...
Ekim, Tınaz +3 more
core +1 more source
Maximum Distance Separable Codes for Symbol-Pair Read Channels [PDF]
, 2013 We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed.
Chengmin Wang +5 more
core +1 more source