Results 1 to 10 of about 7,423,412 (268)

Strong matching of points with geometric shapes [PDF]

open access: yesComputational Geometry, 2015
Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having the two ...
Ahmad Biniaz, A. Maheshwari, M. Smid
semanticscholar   +4 more sources

Strong matching preclusion number of graphs

open access: yesTheoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Y. Mao   +3 more
semanticscholar   +3 more sources

Conditional Strong Matching Preclusion of the Alternating Group Graph

open access: yesTheory and Applications of Graphs, 2019
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj   +2 more sources

Strong matching preclusion for k-composition networks

open access: yesTheoretical Computer Science, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Hu   +3 more
semanticscholar   +2 more sources

Strong matching preclusion for torus networks

open access: yesTheoretical Computer Science, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiying Wang, K. Feng
semanticscholar   +2 more sources

Strong matching preclusion

open access: yesTheoretical Computer Science, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jung-Heum Park, I. Ihm
semanticscholar   +2 more sources

Strong matching preclusion for augmented cubes

open access: yesTheoretical Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Cheng   +3 more
semanticscholar   +3 more sources

Strong matching preclusion of (n, k)-star graphs

open access: yesTheoretical Computer Science, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Cheng, Justin Kelm, Joseph Renzi
semanticscholar   +3 more sources

Strong matching preclusion for non-bipartite torus networks

open access: yesTheoretical Computer Science, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Feng
semanticscholar   +3 more sources

Strong matching preclusion for n-dimensional torus networks

open access: yesTheoretical Computer Science, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Hu   +3 more
semanticscholar   +2 more sources

Home - About - Disclaimer - Privacy