Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Gülnaz Boruzanlı Ekinci"'
Autor:
Gülnaz Boruzanlı Ekinci, Csilla Bujtás
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 1, p 383 (2024)
Externí odkaz:
https://doaj.org/article/9a82f090624e4070b5989d20adf23119
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Graph Theory (2020)
For positive integers $n,k$ and $t$, the uniform subset graph $G(n, k, t)$ has all $k$-subsets of $\{1,2,\ldots, n\}$ as vertices and two $k$-subsets are joined by an edge if they intersect at exactly $t$ elements. The Johnson graph $J(n,k)$ correspo
Externí odkaz:
https://doaj.org/article/4b9ee9c43d8748ec89210d9457d5f4b0
Publikováno v:
RAIRO - Operations Research. 55:S699-S704
The study of connectivity parameters forms an integral part of the research conducted in establishing the fault tolerance of networks. A number of variations on the classical notion of connectivity have been proposed and studied. In particular, the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd80d3888330c0837d958e353f13b613
https://doi.org/10.1051/ro/2020004
https://doi.org/10.1051/ro/2020004
The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4e363f953328cfc646a7ab642a7779d
https://hdl.handle.net/11454/79059
https://hdl.handle.net/11454/79059
Publikováno v:
Discrete Applied Mathematics. 252:2-9
The super-connectivity (super-edge-connectivity) of a connected graph G is the minimum number of vertices (edges) that need to be deleted from G in order to disconnect G without creating isolated vertices. We determine when the generalized Petersen g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf68a1b943cb5b4d9d3817ec9c1effa3
https://doi.org/10.1016/j.dam.2017.02.002
https://doi.org/10.1016/j.dam.2017.02.002
Autor:
Gülnaz Boruzanlı Ekinci, Csilla Bujtás
Publikováno v:
Open Mathematics, Vol 18, Iss 1, Pp 873-885 (2020)
Let k be a positive integer and let G be a graph with vertex set V(G). A subset D subset of V(G) is a k-dominating set if every vertex outside D is adjacent to at least k vertices in D. the k-domination number gamma(k)(G) is the minimum cardinality o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2b0f2c96ada7c8bf6580dfe2ed0fd22
Publikováno v:
TURKISH JOURNAL OF MATHEMATICS. 42:2897-2915
WOS: 000451344700005
The diameter of a graph gives the length of the longest path among all the shortest paths between any two vertices of the graph, and the diameter vulnerability problem measures the change in the diameter upon the deletion of
The diameter of a graph gives the length of the longest path among all the shortest paths between any two vertices of the graph, and the diameter vulnerability problem measures the change in the diameter upon the deletion of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::041fae047660666927fda583a21aa3e9
https://doi.org/10.3906/mat-1802-66
https://doi.org/10.3906/mat-1802-66
Publikováno v:
RAIRO - Operations Research. 52:561-566
Let G1 and G2 be two graphs. The Kronecker product G1 × G2 has vertex set V (G1 × G2) = V (G1) × V (G2) and edge set E(G1 × G2) = {(u1, v1)(u2, v2) : u1u2 ∈ E(G1) and v1v2 ∈ E(G2)}. In this paper we determine the super edge–connectivity of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90292f5c3c3930e046df8ac35c3f753c
https://doi.org/10.1051/ro/2017080
https://doi.org/10.1051/ro/2017080
Publikováno v:
Discrete Mathematics. 339:1950-1953
Let G 1 and G 2 be two graphs. The Kronecker product G 1 × G 2 has vertex set V ( G 1 × G 2 ) = V ( G 1 ) × V ( G 2 ) and edge set E ( G 1 × G 2 ) = { ( u 1 , v 1 ) ( u 2 , v 2 ) : u 1 u 2 ? E ( G 1 ) ?and? v 1 v 2 ? E ( G 2 ) } . In this paper w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c1147822a23a24cb92310ef7823380f
https://doi.org/10.1016/j.disc.2015.10.036
https://doi.org/10.1016/j.disc.2015.10.036
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 1, Pp 5-11 (2019)
WOS: 000454521100001
A vertex cut of a connected graph G is a set of vertices whose deletion disconnects G. A connected graph G is super-connected if the deletion of every minimum vertex cut of G isolates a vertex. The super-connectivity is the
A vertex cut of a connected graph G is a set of vertices whose deletion disconnects G. A connected graph G is super-connected if the deletion of every minimum vertex cut of G isolates a vertex. The super-connectivity is the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a271635c02ac8e87d89ec410d73b4ef2
https://doi.org/10.7151/dmgt.2051
https://doi.org/10.7151/dmgt.2051