Results 61 to 70 of about 163 (126)
Transfer distance between partitions
Partition, Distance, Clustering, Transfer graph, Centrality, 03E02, 05A18, 05C12, 05C35, 05D99, 62G15, 62G30,
Lucile Denœud
core +1 more source
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and . Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
The spectral even cycle problem [PDF]
In this paper, we study the maximum adjacency spectral radii of graphs of large order that do not contain an even cycle of given length. For \(n›k\), let \(S_{n,k}\) be the join of a clique on \(k\) vertices with an independent set of \(n-k\) vertices ...
Tait, Michael +2 more
core +1 more source
Edge-maximal graphs without θ 7 -graphs
, 2011 Let G(n; θ2k+1, ≥ δ) denote the class of non-bipartite θ2k+1-free graphs on n vertices and minimum degree at least δ and let f (n; θ2k+1, ≥ δ) = max{ε(G): G ∈ G(n; θ2k+1, ≥ δ)}. In this paper we determinj an upker bound of f (n; θ7, ≥ 25) by proving that
Bataineh, M.S.A. +2 more
core +1 more source
Graph with extremal connectivity index
, 2008 . Let G be a graph and δv the degree of its vertex v. The connectivity index of G is χ = (δu δv) −1/2, with the summation ranging over all pairs of adjacent vertices of G.
Ljiljana Pavlović, Ivan Gutman
core
On the diameters of friends-and-strangers graphs [PDF]
Given simple graphs \(X\) and \(Y\) on the same number of vertices, the friends-and-strangers graph \(\operatorname{FS}(X, Y)\) has as its vertices all bijections from \(V(X)\) to \(V(Y)\), where two bijections are adjacent if and only if they differ on ...
Jeong, Ryan
core +1 more source
An efficient asymmetric removal lemma and its limitations
Forum of Mathematics, SigmaThe triangle removal states that if G contains $\varepsilon n^2$ edge-disjoint triangles, then G contains $\delta (\varepsilon )n^3$ triangles. Unfortunately, there are no sensible bounds on the order of growth of $\delta (\varepsilon )$
Lior Gishboliner +2 more
doaj +1 more source
Anti-Ramsey Number of Hanoi Graphs
Discussiones Mathematicae Graph Theory, 2019 Let ar(G,H) be the largest number of colors such that there exists an edge coloring of G with ar(G,H) colors such that each subgraph isomorphic to H has at least two edges in the same color. We call ar(G,H) the anti- Ramsey number for a pair of graphs (G,
Gorgol Izolda, Lechowska Anna
doaj +1 more source
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source
Sum Index, Difference Index and Exclusive Sum Number of Graphs. [PDF]
Graphs Comb, 2023 Haslegrave J.
europepmc +1 more source