Results 271 to 280 of about 10,152,062 (308)

Matching numbers in fuzzy graphs

Journal of Applied Mathematics and Computing, 2021
The present study aims to introduce new methods to achieve optimal matching in fuzzy graphs and classify the fuzzy sizes of the edges and vertices of a matching called “matching number”. Matching numbers in a fuzzy graph are not only a direct tool in improving existing matching optimization algorithms, but also can be used to build optimization ...
Majid Khalili, Rajab Ali Borzooei, M. Deldar   +2 more
openaire   +2 more sources

Number of Induced Matchings of Graphs

Acta Mathematicae Applicatae Sinica, English Series, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Yan, Liu, Yan
openaire   +1 more source

Sub-Ramsey Numbers for Matchings

Graphs and Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fangfang Wu, Shenggui Zhang, Binlong Li
openaire   +2 more sources

The Kirchhoff index and the matching number

International Journal of Quantum Chemistry, 2008
AbstractThe Kirchhoff index of a connected (molecular) graph is the sum of the resistance‐distances between all unordered pairs of vertices and may also be expressed by its Laplacian eigenvalues. We determine the minimum Kirchhoff index of connected (molecular) graphs in terms of the number of vertices and matching number and characterize the unique ...
Zhou, Bo, Trinajstic, Nenad
openaire   +3 more sources

On the matching number of an uncertain graph

2018
Summary: Uncertain graphs are employed to describe graph models with indeterministic information that produced by human beings. This paper aims to study the maximum matching problem in uncertain graphs. The number of edges of a maximum matching in a graph is called matching number of the graph.
Li, Hui, Zhang, Bo, Peng, Jin
openaire   +2 more sources

On Neighbourhood Matching for Texture‐by‐Numbers

Computer Graphics Forum, 2010
Abstract Texture‐by‐Numbers is an attractive texture synthesis framework, because it is able to cope with non‐homogeneous texture exemplars, and provides the user with intuitive creative control over the outcome of the synthesis process. Like many other exemplar‐based texture synthesis methods, its basic underlying mechanism is neighbourhood matching ...
Eliyahu Sivaks, Dani Lischinski
openaire   +1 more source

The fractional matching numbers of graphs

Networks, 2002
AbstractA fractional matching of a graph G is a function f that assigns to each edge a number in [0, 1] such that, for each vertex v, ∑ f(e) ≤ 1, where the sum is taken over all edges incident to v. The fractional matching number of G is the supremum of ∑e∈E(G) f(e) over all fractional matchings f.
Yan Liu, Guizhen Liu
openaire   +3 more sources