Skip to main content
MathOverflow

Return to Question

corrected problem introduced by edit that I wanted to reject, but others approved first
Source Link
user9072
user9072

Let $f(G)$ denote any parameter of a graph $G$ for which $f(G) \geq f(G - {v})$$f(G) \geq f(G - \{v \})$, where $v$ is any vertex in $G$. We could describe such parameters as being monotone under vertex deletion. Does anyone know where I could find a reasonably comprehensive list of such parameters? If so, thank you.

Let $f(G)$ denote any parameter of a graph $G$ for which $f(G) \geq f(G - {v})$, where $v$ is any vertex in $G$. We could describe such parameters as being monotone under vertex deletion. Does anyone know where I could find a reasonably comprehensive list of such parameters? If so, thank you.

Let $f(G)$ denote any parameter of a graph $G$ for which $f(G) \geq f(G - \{v \})$, where $v$ is any vertex in $G$. We could describe such parameters as being monotone under vertex deletion. Does anyone know where I could find a reasonably comprehensive list of such parameters? If so, thank you.

TeX improvements
Source Link
edit approved Oct 14, 2013 at 12:24
Sergiy Kozerenko
edit approved Oct 14, 2013 at 12:24
Sergiy Kozerenko
  • 747
  • 1
  • 7
  • 17

Let f(G)$f(G)$ denote any parameter of a graph G$G$ for which f(G) >= f(G - {v})$f(G) \geq f(G - {v})$, where v$v$ is any vertex in G$G$. We could describe such parameters as being monotone under vertex deletion. Does anyone know where I could find a reasonably comprehensive list of such parameters? If so, thank you.

Let f(G) denote any parameter of a graph G for which f(G) >= f(G - {v}), where v is any vertex in G. We could describe such parameters as being monotone under vertex deletion. Does anyone know where I could find a reasonably comprehensive list of such parameters? If so, thank you.

Let $f(G)$ denote any parameter of a graph $G$ for which $f(G) \geq f(G - {v})$, where $v$ is any vertex in $G$. We could describe such parameters as being monotone under vertex deletion. Does anyone know where I could find a reasonably comprehensive list of such parameters? If so, thank you.

Source Link
clive elphick
clive elphick
  • 9
  • 1

Monotone graph parameters under vertex deletion

Let f(G) denote any parameter of a graph G for which f(G) >= f(G - {v}), where v is any vertex in G. We could describe such parameters as being monotone under vertex deletion. Does anyone know where I could find a reasonably comprehensive list of such parameters? If so, thank you.