Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Bijo S. Anand"'
Publikováno v:
Discrete Applied Mathematics. 319:487-498
Given a graph G and a set S ⊆ V ( G ) , the Δ -interval of S , [ S ] Δ , is the set formed by the vertices of S and every w ∈ V ( G ) forming a triangle with two vertices of S . If [ S ] Δ = S , then S is Δ -convex of G ; if [ S ] Δ = V ( G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af25fb8d2f65c27c2961c9e1200a4dba
https://doi.org/10.1016/j.dam.2021.07.041
https://doi.org/10.1016/j.dam.2021.07.041
Publikováno v:
Ars Mathematica Contemporanea. 20:275-288
Let D = ( V , E ) be a strongly connected digraph and let u and v be two vertices in D . The maximum distance md( u , v ) is defined as md( u , v ) = max{ d ( u , v ), d ( v , u )} , where d ( u , v ) denotes the length of a shortest directed u - v p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7e9bc5509403527be638cf8cd9cf680
https://doi.org/10.26493/1855-3974.2229.5f1
https://doi.org/10.26493/1855-3974.2229.5f1
Publikováno v:
Theoretical Computer Science. 844:217-226
Given a graph G, a set S ⊆ V ( G ) is Δ-convex if there is no vertex u ∈ V ( G ) ∖ S forming a triangle with two vertices of S. The Δ-convex hull of S is the minimum Δ-convex set containing S. The Δ-hull number of a graph G is the cardinali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfed1e76b8b7e4ae0434870357e075a4
https://doi.org/10.1016/j.tcs.2020.08.024
https://doi.org/10.1016/j.tcs.2020.08.024
Autor:
S V Ullas Chandran, Ferdoos Hossein Nezhad, Prasanth G. Narasimha-Shenoi, Mitre Costa Dourado, Manoj Changat, Bijo S. Anand
Publikováno v:
Theoretical Computer Science. 804:46-57
A set of vertices S of a graph G is geodesically convex if for every pair of vertices of S, all vertices of all shortest paths joining them also lie in S. The geodetic convex hull of S, denoted by 〈 S 〉 , is the minimum geodesically convex set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c42ba942b58d93f0a4f0839ca941041
https://doi.org/10.1016/j.tcs.2019.10.041
https://doi.org/10.1016/j.tcs.2019.10.041
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
The \(\varDelta \)-interval of \(u,v \in V (G)\), \(I_{\varDelta }(u,v)\), is the set formed by u, v and every w in V(G) such that \(\{u, v, w\}\) is a triangle \((K_3)\) of G. A set S of vertices such that \(I_{\varDelta } (S)=V(G)\) is called a \(\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6543aac7bac47a8512161e1832c2b9d
https://doi.org/10.1007/978-3-030-39219-2_18
https://doi.org/10.1007/978-3-030-39219-2_18
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783319741796
CALDAM
CALDAM
For a nontrivial connected graph \(G=(V(G),E(G)),\) a set \(S\subseteq V(G)\) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number eg(G) of G is the minimum ord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::001469b38acc79cdabae02c5293fd3d6
https://doi.org/10.1007/978-3-319-74180-2_12
https://doi.org/10.1007/978-3-319-74180-2_12
Publikováno v:
Applicable Analysis and Discrete Mathematics. 6:46-62
We describe in present work all minimal clique separators of all four standard products: the Cartesian, the strong, the direct, and the lexicographic, as well as all maximal atoms of the Cartesian, the strong and the lexicographic product, while we o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9ff16e21b09f403f7319519d1162882
https://doi.org/10.2298/aadm111230001a
https://doi.org/10.2298/aadm111230001a
Publikováno v:
Graphs and Combinatorics. 28:77-84
Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27c7de16828e4cba546a16df61da6366
https://doi.org/10.1007/s00373-011-1031-4
https://doi.org/10.1007/s00373-011-1031-4
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1550049
We discuss the convexity invariants, namely, the exchange and Helly numbers of the Steiner and geodesic convexity in lexicographic product of graphs. We use the structure of both the Steiner and geodesic convex sets in the lexicographic product for p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::559322eaf52fc5e7b01f19c75b1211cf
https://doi.org/10.1142/s1793830915500494
https://doi.org/10.1142/s1793830915500494
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1450060
Let G be a graph and W a subset of V(G). A subtree with the minimum number of edges that contains all vertices of W is a Steiner tree for W. The number of edges of such a tree is the Steiner distance of W and union of all vertices belonging to Steine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adbee17f044d6c8bbadc45bde141afe4
https://doi.org/10.1142/s1793830914500608
https://doi.org/10.1142/s1793830914500608