In the book (Introduction to Graph Theory) by Douglas West , what is the meaning of the square brackets in $|[ S , \overline{S} ]|$ ?
2026-05-13 17:45:31.1778694331
What is the meaning of the square brackets in theorem 8.6.30 (Introduction to Graph Theory) book?
73 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in EIGENVALUES-EIGENVECTORS
- Stability of system of parameters $\kappa, \lambda$ when there is a zero eigenvalue
- Stability of stationary point $O(0,0)$ when eigenvalues are zero
- Show that this matrix is positive definite
- Is $A$ satisfying ${A^2} = - I$ similar to $\left[ {\begin{smallmatrix} 0&I \\ { - I}&0 \end{smallmatrix}} \right]$?
- Determining a $4\times4$ matrix knowing $3$ of its $4$ eigenvectors and eigenvalues
- Question on designing a state observer for discrete time system
- Evaluating a cubic at a matrix only knowing only the eigenvalues
- Eigenvalues of $A=vv^T$
- A minimal eigenvalue inequality for Positive Definite Matrix
- Construct real matrix for given complex eigenvalues and given complex eigenvectors where algebraic multiplicity < geometric multiplicity
Related Questions in NOTATION
- Symbol for assignment of a truth-value?
- Does approximation usually exclude equality?
- Is division inherently the last operation when using fraction notation or is the order of operation always PEMDAS?
- Question about notation $S^c$
- strange partial integration
- What does Kx mean in this equation? [in Carnap or Russell and Whitehead's logical notation]
- Need help with notation. Is this lower dot an operation?
- What does this "\" mathematics symbol mean?
- Why a set or vector start counting from a negative or zero index?
- How to express a sentence having two for all?
Related Questions in PROOF-EXPLANATION
- (From Awodey)$\sf C \cong D$ be equivalent categories then $\sf C$ has binary products if and only if $\sf D$ does.
- Help with Propositional Logic Proof
- Lemma 1.8.2 - Convex Bodies: The Brunn-Minkowski Theory
- Proof of Fourier transform of cos$2\pi ft$
- Total number of nodes in a full k-ary tree. Explanation
- Finding height of a $k$-ary tree
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Inner Product Same for all Inputs
- Complex Derivatives in Polar Form
- Confused about how to prove a function is surjective/injective?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
geometry
circles
algebraic-number-theory
functions
real-analysis
elementary-set-theory
proof-verification
proof-writing
number-theory
elementary-number-theory
puzzle
game-theory
calculus
multivariable-calculus
partial-derivative
complex-analysis
logic
set-theory
second-order-logic
homotopy-theory
winding-number
ordinary-differential-equations
numerical-methods
derivatives
integration
definite-integrals
probability
limits
sequences-and-series
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?

That text book has the Answer on Page 152 :
"Given $S , T \subset V(G)$ , we write $[S , T]$ for the Set of Edges having one End-Point in $S$ and the other in $T$.
An Edge Cut is an Edge Set of the form $[S , \overline{S}]$ , where $S$ is a Non-Empty Proper Sub-Set of $V(G)$ and $\overline{S}$ denotes $V(G) - S$."
Concisely , the Author later states that "It is the set of edges joining a vertex in $S$ to a vertex not in $S$" , which is very Intuitive.
More-over , it is standard convention / notation to use $|A|$ to indicate Size of Set $A$.
Hence , $|[S , \overline{S}]|$ indicates "the Size of the Edge Cut" , while that theorem is giving a lower Bound on this Size.
Here is that Page with more Detail :