Difference between r1.2 and the current

@@ -1,23 +1,80 @@

#noindex

Of [[그래프이론,graph_theory]].

<<tableofcontents>>

= vertex / edge =

[[vertex_connectivity]] κ(G)

=,vertex_connectivity =,vertex_connectivity . vertex_connectivity

{

vertex connectivity

https://mathworld.wolfram.com/VertexConnectivity.html

"vertex connectivity"

Up: [[버텍스,vertex]] -번역tbd

}

[[edge_connectivity]] λ(G) edge-connectivity

=,edge_connectivity =,edge_connectivity . edge_connectivity

{

edge connectivity

https://mathworld.wolfram.com/EdgeConnectivity.html

WpEn:Edge_connectivity redir to WpEn:K-edge-connected_graph

"edge connectivity"

Up: [[에지,edge]] - 번역tbd

}

= super, hyper =

super-connectivity superconnectivity

~~WtEn:superconnectivity~~ x [[Date(2023-08-22T21:17:44)]]

semitwin:

''[[WpEn:Superconnectivity]] redir. to [[WpEn:Connectivity_(graph_theory)#Super-_and_hyper-connectivity]]''

hyper-connectivity hyperconnectivity

WtEn:hyperconnectivity

[[WpEn:Hyperconnectivity]] = https://en.wikipedia.org/wiki/Hyperconnectivity (그래프이론적인 서술은 아님)

algebraic_connectivity { WpEn:Algebraic_connectivity "of a graph G is the second-smallest eigenvalue (counting multiple eigenvalues separately) of the [[Laplacian_matrix]] of G" }

= algebraic =

algebraic_connectivity { WpEn:Algebraic_connectivity "of a graph G is the second-smallest [[eigenvalue]] (counting multiple eigenvalues separately) of the [[Laplacian_matrix]] of G" }

~~----~~

= rel. component ...? 여기있어야할것 아님 connection 으로? =

[[성분,component]]:

[[connected_component]] =,connected_component . connected_component

{

[[WtEn:connected_component]]

연결성분 (kms)

}

[[strongly_connected_component]] =,strongly_connected_component . strongly_connected_component

{

[[WtEn:strongly_connected_component]]

}

= pixel * =

[[픽셀,pixel]] or [[화소,pixel]] ?

https://en.wikipedia.org/wiki/Pixel_connectivity

= Sub 끝 =

Cmp:
[[연결,connection]] ''QQQ connection 저건 이어져 있다는 '개념'이고, connectivity 이건 저런 '성질'?'' WtEn:connection WtEn:connectivity ... 대략 맞는듯?

Cmp:

[[adjacency]] =,adjacency .

[[adjacency]] =,adjacency . adjacency Srch:adjacency

{
KmsE:adjacency
WtEn:adjacency [[Date(2023-08-13T15:19:02)]]현재 유일: {adjacency matrix 인접행렬 }
Ndict:adjacency
MathWorld:adjacency MathWorld:Adjacency

[[Date(2023-08-13T15:21:31)]] 없음. 검색하면 다음 있음

MathWorld:AdjacencyMatrix

MathWorld:AdjacencyList

MathWorld:AdjacencyRelation .... [[관계,relation]] of [[그래프이론,graph_theory]]

Naver:adjacency+번역
Ggl:adjacency+번역

@@ -27,14 +84,15 @@

via wten
adjacency list
adjacency matrix

adjacency pair { 언어학 > 화용론 pragmatics ? (대화의) 인접쌍. https://en.wikipedia.org/wiki/Adjacency_pairs }

adjacency pair

{ 언어학 > 화용론 pragmatics ? (대화의) 인접쌍. https://en.wikipedia.org/wiki/Adjacency_pairs }

}

----
WtEn:connectivity
KmsE:connectivity

Ndict:connectivity

MathWorld:Connectivity

Ndict:connectivity ... 보면 page name 문제 없음 (연결성이 대세)

MathWorld:Connectivity MathWorld:connectivity

KmsK:연결성
Ndict:연결성

@@ -43,3 +101,5 @@

MKLINK
[[연결,connection]]

Up: [[성질,property]]

Of 그래프이론,graph_theory.

1. vertex / edge
2. super, hyper
3. algebraic
4. rel. component ...? 여기있어야할것 아님 connection 으로?
5. pixel *
6. Sub 끝

[edit]

1. vertex / edge ¶

vertex_connectivity κ(G)
=,vertex_connectivity =,vertex_connectivity . vertex_connectivity
{
vertex connectivity

https://mathworld.wolfram.com/VertexConnectivity.html
"vertex connectivity"

Up: 버텍스,vertex -번역tbd
}

edge_connectivity λ(G) edge-connectivity
=,edge_connectivity =,edge_connectivity . edge_connectivity
{
edge connectivity

https://mathworld.wolfram.com/EdgeConnectivity.html

Edge_connectivity redir to

K-edge-connected_graph
"edge connectivity"

Up: 에지,edge - 번역tbd
}

[edit]

2. super, hyper ¶

super-connectivity superconnectivity
~~superconnectivity~~ x 2023-08-23
semitwin:
Superconnectivity redir. to Connectivity_(graph_theory)#Super-_and_hyper-connectivity

hyper-connectivity hyperconnectivity

hyperconnectivity

Hyperconnectivity = https://en.wikipedia.org/wiki/Hyperconnectivity (그래프이론적인 서술은 아님)

[edit]