Results 61 to 70 of about 1,099 (89)

An efficient asymmetric removal lemma and its limitations

Forum of Mathematics, Sigma
The 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, Asaf Shapira, Yuval Wigderson   +2 more
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

Inverse Problem on the Steiner Wiener Index

Discussiones Mathematicae Graph Theory, 2018
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G)dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of
Li Xueliang, Mao Yaping, Gutman Ivan
doaj   +1 more source

A note on the edge general position number of cactus graphs

Open Mathematics
For a given graph G, a subset S of E(G) is an edge general position set of G if no triple of S is contained in a common shortest path. The cardinality of a largest edge general position set of G is called the edge general position number of G, denoted by
Cao Yahan, Ji Shengjin
doaj   +1 more source

More Results on The Smallest One-Realization of A Given Set II

Discussiones Mathematicae Graph Theory, 2019
Let S be a finite set of positive integers. A mixed hypergraph ℋ is a onerealization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1.
Diao Kefeng, Lu Fuliang, Zhao Ping
doaj   +1 more source

Quasirandom Graphs and the Pantograph Equation. [PDF]

Am Math Mon, 2021
Shapira A, Tyomkyn M.
europepmc   +1 more source

A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S., Parpalea M. M., Parpalea M.   +2 more
doaj   +1 more source

Maximum Edge-Colorings Of Graphs

Discussiones Mathematicae Graph Theory, 2016
An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav, Vrbjarová Michaela   +1 more
doaj   +1 more source

The Minimum Harmonic Index for Unicyclic Graphs with Given Diameter

Discussiones Mathematicae Graph Theory, 2018
The harmonic index of a graph G is defined as the sum of the weights 2d(u)+d(v)${2 \over {d(u) + d(v)}}$ of all edges uv of G, where d(u) denotes the degree of a vertex u in G.
Zhong Lingping
doaj   +1 more source

Spectral Radius and Hamiltonicity of Graphs

Discussiones Mathematicae Graph Theory, 2019
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement,
Yu Guidong, Fang Yi, Fan Yizheng, Cai Gaixiang   +3 more
doaj   +1 more source