Log in

Relevant bibliographies by topics / Distance Two Domination / Journal articles

To see the other types of publications on this topic, follow the link: Distance Two Domination.

Journal articles on the topic 'Distance Two Domination'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Distance Two Domination.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Retnowardani, Dwi Agustin, Liliek Susilowati, Dafik, and Kamal Dliou. "Distance k-domination and k-resolving domination of the corona product of graphs." Statistics, Optimization & Information Computing 13, no. 1 (2024): 72–87. https://doi.org/10.19139/soic-2310-5070-2101.

Full text

Abstract:

For two simple graphs $G$ and $H$, the corona product of $G$ and $H$ is the graph obtained by adding a copy of $H$ for every vertex of $G$ and joining each vertex of $G$ to its corresponding copy of $H$. For $k \geq 1$, a set of vertices $D$ in a graph $G$ is a distance $k$-dominating set if any vertex in $G$ is at a distance less or equal to $k$ from some vertex in $D$. The minimum cardinality overall distance $k$-dominating sets of $G$ is the distance $k$-domination number, denoted by $\gamma_k(G)$. The metric dimension of a graph is the smallest number of vertices required to distinguish al

APA, Harvard, Vancouver, ISO, and other styles

2

Saifudin, Ilham, Triyanna Widiyaningtyas, Rohmad Wahid Rhomdani, and Moh Dasuki. "Domination Numbers in Graphs Resulting from Shackle Operations with Linkage of any Graph." JTAM (Jurnal Teori dan Aplikasi Matematika) 8, no. 2 (2024): 336. http://dx.doi.org/10.31764/jtam.v8i2.19675.

Full text

Abstract:

The domination number is the number of dominating nodes in a graph that can dominate the surrounding connected nodes with a minimum number of dominating nodes. This domini number is denoted by γ(G). In this research, we will examine the domination number of the distance between two graphs resulting from the shackle operation with any graph as linkage. This differs from previous research, namely the domination of numbers at one and two distances. This study emphasizes how the results of operations on the shackle are connected to the shackle graph as any graph connects the copy. Any graph here m

APA, Harvard, Vancouver, ISO, and other styles

3

Bacsó, Gabor, Attila Tálos, and Zsolt Tuza. "Graph Domination in Distance Two." Discussiones Mathematicae Graph Theory 25, no. 1-2 (2005): 121. http://dx.doi.org/10.7151/dmgt.1266.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bijo S Anand, Jonecis A. Dayap, Leomarich F. Casinillo, Ryan Pepper, and Revathy S Nair. "On distance k-domination number of graphs under product operations." Gulf Journal of Mathematics 19, no. 1 (2025): 117–24. https://doi.org/10.56947/gjom.v19i1.2032.

Full text

Abstract:

For a positive integer k, a subset S ⊆ V(G) is said to be a k-dominating set of G if every vertex v ∈ V(G)\S is at a distance of at most k from some vertex of S. The cardinality of the minimum k-dominating set of G is the k-domination number, denoted by γk(G). In this article, we determine the distance k-domination number for two graphs under some product operations in terms of its factor graphs.

APA, Harvard, Vancouver, ISO, and other styles

5

Lekha, A. "A COMPREHENSIVE REVIEW OF DISJUNCTIVE DOMINATION IN GRAPHS." Universal Journal of Mathematics and Mathematical Sciences 20, no. 2 (2024): 163–72. http://dx.doi.org/10.17654/2277141724010.

Full text

Abstract:

A disjunctive dominating set of a graph is a subset such that every vertex is either adjacent to a vertex of or has at least two vertices in at a distance two from it in . The disjunctive domination number of , denoted by , is the minimum cardinality of a disjunctive dominating set. This paper provides a comprehensive survey of key results and findings on disjunctive domination in graphs.

APA, Harvard, Vancouver, ISO, and other styles

6

Canoy Jr, Sergio, Ferdinand Jamil, and Sheila Menchavez. "Hop Italian Domination in Graphs." European Journal of Pure and Applied Mathematics 16, no. 4 (2023): 2431–49. http://dx.doi.org/10.29020/nybg.ejpam.v16i4.4914.

Full text

Abstract:

Given a simple graph $G=(V(G),E(G))$, a function $f:V(G)\to \{0,1,2\}$ is a hop Italian dominating function if for every vertex $v$ with $f(v)=0$ there exists a vertex $u$ with $f(u)=2$ for which $u$ and $v$ are of distance $2$ from each other or there exist two vertices $w$ and $z$ for which $f(w)=1=f(z)$ and each of $w$ and $z$ is of distance $2$ from $v$. The minimum weight $\sum_{v\in V(G)}f(v)$ of a hop Italian dominating function is the hop Italian domination number of $G$, and is denoted by $\gamma_{hI}(G)$. In this paper, we initiate the study of the hop Italian domination. In particul

APA, Harvard, Vancouver, ISO, and other styles

7

S. H. Karkar. "Detour Domination Number of Some Cycle Related Graphs and its Role in the Installation of Electrical Appliances." Journal of Electrical Systems 20, no. 9s (2024): 2684–92. http://dx.doi.org/10.52783/jes.4959.

Full text

Abstract:

The detour distance between two vertices of a connected graph is the length of a longest path between them. A set of vertices of is called detour dominating set if every vertex of is detour dominated by some vertex in. A detour dominating set of minimum cardinality is a minimum detour dominating set and its cardinality is the detour domination number. We present here a general class of a - regular Hamiltonian connected graph with. Moreover, we investigate the detour domination number of some cycle related graphs.

APA, Harvard, Vancouver, ISO, and other styles

8

N. Ulal, Noor-Sharief, Javier Hassan, Mercedita A. Langamin, and Noor-Han N. Ulal. "Characterizing 2-Distance Certified Hop Dominating Sets Using Co-Certified Pointwise Non-domination Concept." European Journal of Pure and Applied Mathematics 18, no. 1 (2025): 5625. https://doi.org/10.29020/nybg.ejpam.v18i1.5625.

Full text

Abstract:

Let $G$ be a graph. Then $C \subseteq V(G)$ is called a 2-distance certified hop dominating if $\forall$ $x \in V(G) \backslash C$, there exists $y \in C$ such that $d_G(x,y)=2$ and $\forall$ $a \in C$, $|N^2_G (a)\backslash C|=0$ or $|N^2_G (a)\backslash C|\geq 2$. The 2-distance certified hop domination number of $G$, denoted by $\gamma_{2ch}(G)$, is the minimum cardinality among all 2-distance certified hop dominating sets of $G$. In this study, the researchers give some properties of this concept on some graphs, and present some its connections with others parameters. Also, the researchers

APA, Harvard, Vancouver, ISO, and other styles

9

Susada, Bryan L., and Rolito G. Eballe. "Independent Semitotal Domination in the Join of Graphs." Asian Research Journal of Mathematics 19, no. 3 (2023): 25–31. http://dx.doi.org/10.9734/arjom/2023/v19i3647.

Full text

Abstract:

A subset W \(\subseteq\) V (G) of a graph G is an independent semitotal dominating set of G, abbreviated ISTd-set of G, if W is an independent dominating set of G and every element of W is exactly of distance 2 from at least one other element of W. The independent semitotal domination number of G, denoted by \(\gamma\)it2(G), is the minimum cardinality of an ISTd-set of G. In this paper, we study the concept of independent semitotal domination in graphs and investigate the conditions for graphs on which the ISTd-sets exist. Further, the ISTd-sets of the join of any two graphs are examined. Con

APA, Harvard, Vancouver, ISO, and other styles

10

Catian, Dyjay Bill, Imelda Aniversario, and Ferdinand Jamil. "On Minimal Geodetic Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 17, no. 3 (2024): 1737–50. http://dx.doi.org/10.29020/nybg.ejpam.v17i3.5251.

Full text

Abstract:

Let $G$ be a nontrivial connected graph with vertex set $V(G)$. A set $S \subseteq V(G)$ is a geodetic hop dominating set of $G$ if the following two conditions hold for each $x\in V(G)\setminus S$: $(1)$ $x$ lies in some $u$-$v$ geodesic in $G$ with $u,v\in S$, and $(2)$ $x$ is of distance $2$ from a vertex in $S$. The minimum cardinality $\gamma_{hg}(G)$ of a geodetic hop dominating set of $G$ is the geodetic hop domination number of $G$. A geodetic hop dominating set $S$ is a minimal geodetic hop dominating set if $S$ does not contain a proper subset that is itself geodetic hop dominating s

APA, Harvard, Vancouver, ISO, and other styles

11

Mangal Pati, Mangal Pati, Uma Shankar Uma Shankar, Sambhu Charan Barman Sambhu Charan Barman, and Prodip Karmakar Prodip Karmakar. "An Efficient Algorithm to Find Minimum Extended Dominating Set in Cactus Graphs: Application In Wireless Sensor Networks." Journal of Research in Applied Mathematics 11, no. 6 (2025): 27–34. https://doi.org/10.35629/0743-11062734.

Full text

Abstract:

In a graph G and a positive integer k, a vertex set S, a subset of V is referred as a k-extended dominating set of G if for each vertex u of V , either the distance between u and at least one member of S is maximum one or there exist minimum k distinct vertices v1, v2, ...vk ∈ S such that u is situated exactly two distances from each vertex vi, i = 1, 2, ...k. The minimum number of elements among all minimum k-extended dominating sets of a graph G is termed as the k-extended domination number, denoted by γk(G). When k = 2, the set is known as an extended dominating set, and the corresponding m

APA, Harvard, Vancouver, ISO, and other styles

12

Sridharan, N., V. S. A. Subramanian, and M. D. Elias. "Bounds on the Distance Two-Domination Number of a Graph." Graphs and Combinatorics 18, no. 3 (2002): 667–75. http://dx.doi.org/10.1007/s003730200050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Tejaskumar R and A. Mohamed Ismayil. "The Minimum Superior Dominating Energy of Graphs." Asian Research Journal of Mathematics 20, no. 1 (2024): 62–69. http://dx.doi.org/10.9734/arjom/2024/v20i1781.

Full text

Abstract:

Kathiresan and Marimuthu were the pioneers of superior distance in graphs. The same authors put forth the concept of superior domination in 2008. Superior distance is the shortest walk between any two vertices including their respective neighbours. The minimum superior dominating energy is defined by the sum of the eigenvalues and it is obtained from the minimum superior dominating matrix . The minimum superior dominating energy for star and crown graphs are computed. Properties of eigenvalues of minimum superior dominating matrix for star, cocktail party, complete and crown graphs are discuss

APA, Harvard, Vancouver, ISO, and other styles

14

Malalay, Rolando Penafiel, and Ferdinand Paler Jamil. "Restrained Disjunctive Domination in Graphs under Some Binary Operations." European Journal of Pure and Applied Mathematics 15, no. 1 (2022): 207–23. http://dx.doi.org/10.29020/nybg.ejpam.v15i1.4187.

Full text

Abstract:

A set S âŠ† V (G) is a disjunctive dominating set of a graph G if for every v âˆˆ V (G)\S, v is a neighbor of a vertex in S or S has at least two vertices each at distance 2 from v. We say that a disjunctive dominating set S of G is a restrained disjunctive dominating set if for each v âˆˆ V (G)\S there exists u âˆˆ V (G) \ S such that uv âˆˆ E(G) or there exist distinct vertices u, w âˆˆ V (G) \ S such that dG(u, v) = 2 = dG(w, v). The minimum cardinality Î³dr(G) of a restrained disjunctive dominating set of G is the restrained disjunctive domination number of G. In this paper, we characteriz

APA, Harvard, Vancouver, ISO, and other styles

15

GAIRING, MARTIN, WAYNE GODDARD, STEPHEN T. HEDETNIEMI, PETTER KRISTIANSEN, and ALICE A. McRAE. "DISTANCE-TWO INFORMATION IN SELF-STABILIZING ALGORITHMS." Parallel Processing Letters 14, no. 03n04 (2004): 387–98. http://dx.doi.org/10.1142/s0129626404001970.

Full text

Abstract:

In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system (seeing its neighbors' states), yet in a finite amount of time the system converges to a global state satisfying some desired property. In this paper we introduce a general mechanism that allows a node to act only on correct distance-two knowledge, provided there are IDs. We then apply the mechanism to graph problems in the areas of coloring and domination. For example, we obtain an algorithm for maximal 2-packing which is guaranteed to stabilize in polynomial moves

APA, Harvard, Vancouver, ISO, and other styles

16

Fricke, Gerd H., Michael A. Henning, Ortrud R. Oellermann, and Henda C. Swart. "An algorithm to find two distance domination parameters in a graph." Discrete Applied Mathematics 68, no. 1-2 (1996): 85–91. http://dx.doi.org/10.1016/0166-218x(95)00057-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Wong, Dein, Xinlei Wang, and Chunguang Xia. "On two conjectures on the subspace inclusion 6 graph of a vector space." Journal of Algebra and Its Applications 17, no. 10 (2018): 1850189. http://dx.doi.org/10.1142/s021949881850189x.

Full text

Abstract:

The subspace inclusion graph on a vector space [Formula: see text], denoted by [Formula: see text], is a graph whose vertex set consists of nontrivial proper subspaces of [Formula: see text] and two vertices are adjacent if one is properly contained in another. In a recent paper, Das posed the following four conjectures on the subspace inclusion graph [Formula: see text]: If [Formula: see text] is a [Formula: see text]-dimensional vector space over a finite field [Formula: see text] with [Formula: see text] elements, then: (1) The domination number of [Formula: see text] is [Formula: see text]

APA, Harvard, Vancouver, ISO, and other styles

18

Hamja, Jamil, Seyed Mahmoud Sheikholeslami, Aniversario Imelda, and Lyster Rey Cabardo. "Hop $k$-Rainbow Domination in Graphs." European Journal of Pure and Applied Mathematics 18, no. 2 (2025): 5973. https://doi.org/10.29020/nybg.ejpam.v18i2.5973.

Full text

Abstract:

Let \( G = (V(G), E(G)) \) be a graph. A function \( f \) that assigns to each vertex \linebreak of $G$ a subset of colors from the set \( \{1, 2, \dots, k\} \), i.e., \( f : V(G) \rightarrow P(\{1, 2, 3, \dots, k\}) \), is called a \textit{hop \( k \)-rainbow dominating function} (H$k$RDF) of \( G \) if for every vertex \( v \in V(G)\) with $f(v)= \varnothing$, we have \( \bigcup_{u \in N^{2}_{G}(v)} f(u) = \{1, 2, \dots, k\} \) where $N^{2}_{G}(v)$ is the set of vertices of $G$ at distance two from $v$. The \textit{weight} of \( f \), denoted \( w(f) \), is defined as \( w(f) = \sum_{x \in V

APA, Harvard, Vancouver, ISO, and other styles

19

Yi, Eunjeong. "Disjunctive total domination in permutation graphs." Discrete Mathematics, Algorithms and Applications 09, no. 01 (2017): 1750009. http://dx.doi.org/10.1142/s1793830917500094.

Full text

Abstract:

Let [Formula: see text] be a graph with vertex set [Formula: see text] and edge set [Formula: see text]. If [Formula: see text] has no isolated vertex, then a disjunctive total dominating set (DTD-set) of [Formula: see text] is a vertex set [Formula: see text] such that every vertex in [Formula: see text] is adjacent to a vertex of [Formula: see text] or has at least two vertices in [Formula: see text] at distance two from it, and the disjunctive total domination number [Formula: see text] of [Formula: see text] is the minimum cardinality overall DTD-sets of [Formula: see text]. Let [Formula:

APA, Harvard, Vancouver, ISO, and other styles

20

González, Yero, and Magdalena Lemńska. "Convex dominating-geodetic partitions in graphs." Filomat 30, no. 11 (2016): 3075–82. http://dx.doi.org/10.2298/fil1611075g.

Full text

Abstract:

The distance d(u,v) between two vertices u and v in a connected graph G is the length of a shortest u-v path in G. A u-v path of length d(u,v) is called u-v geodesic. A set X is convex in G if vertices from all a -b geodesics belong to X for every two vertices a,b?X. A set of vertices D is dominating in G if every vertex of V-D has at least one neighbor in D. The convex domination number con(G) of a graph G equals the minimum cardinality of a convex dominating set in G. A set of vertices S of a graph G is a geodetic set of G if every vertex v ? S lies on a x-y geodesic between two vertices x,y

APA, Harvard, Vancouver, ISO, and other styles

21

Mandorino, Mauro, Tim J. Gabbett, Antonio Tessitore, Cedric Leduc, Valerio Persichetti, and Mathieu Lacome. "The Interaction of Fitness and Fatigue on Physical and Tactical Performance in Football." Applied Sciences 15, no. 7 (2025): 3574. https://doi.org/10.3390/app15073574.

Full text

Abstract:

Elite football players face increasing physical and tactical demands due to rising match schedules emphasizing the need for effective load monitoring strategies to optimize performance and reduce injury risk. This study integrates fitness and fatigue indices derived from a machine learning approach to develop a performance score based on Banister’s fitness–fatigue model. Data were collected over two seasons (2022/23 and 2023/24) from 23 elite players of an Italian professional team. Fitness was assessed via heart rate collected during small-sided games, while fatigue was evaluated through Play

APA, Harvard, Vancouver, ISO, and other styles

22

Westphal, Manon. "For an Agonistic Element in Realist Legitimacy." Social Theory and Practice 48, no. 1 (2022): 165–91. http://dx.doi.org/10.5840/soctheorpract20211217150.

Full text

Abstract:

The article shows that an uncritical view of domination is a weakness of current accounts of realist legitimacy and it argues that an agonistic supplement can help overcome that weakness. Two accounts of realist legitimacy are discussed: the moral minimum account and the acceptance account. In each case, certain modifications of the argument are needed to establish a distance from moralism, but these modifications create an indifference to domination. The incorporation of an agonistic principle into realist legitimacy can solve this problem. The agonistic case for effective possibilities for c

APA, Harvard, Vancouver, ISO, and other styles

23

ZHOU, JUEJIA, and CHUNDI MU. "DENSITY DOMINATION OF QoS CONTROL IN WIRELESS SENSOR NETWORKS." International Journal of Information Acquisition 03, no. 04 (2006): 283–300. http://dx.doi.org/10.1142/s0219878906001039.

Full text

Abstract:

Wireless sensor networks (WSN) are a kind of networks made of tiny sensing embedded devices with processors, memories and short-range wireless communication modules. They are planted for sensing the area which people mostly care about and to send data of light, pressure, sound, and so on, back to people to make further analyses. Differing from normal linear networks, WSN are usually restricted by energy store, plethoric information flow, and short communication distance. So, there are many research hotpots in WSN such as routing, economization of energy, adaptive self-configuration, etc. Among

APA, Harvard, Vancouver, ISO, and other styles

24

Wezel, Katja, and Boris Belge. "Entangled Competition: Globalization, Imperial Domination, and Local Development in the Port Cities of Riga and Odesa." Slavic Review 83, no. 3 (2024): 541–58. https://doi.org/10.1017/slr.2024.498.

Full text

Abstract:

AbstractRiga and Odesa (Odessa) rank among the Russian empire's foremost nineteenth-century ports. These port cities, respectively located on the Baltic and Black Seas, enabled imperial Russia to trade huge amounts of goods, boosting its burgeoning economy in the second half of the nineteenth century. We argue that, despite the distance separating the two cities, it is only in relation to each other that their full significance emerges. This article explores the histories of Riga and Odesa, examining their situations within the Russian empire's economic geography and taking a closer look at th

APA, Harvard, Vancouver, ISO, and other styles

25

Guo, Yunxiang, Xinsong Zhang, Daxiang Li, et al. "Multiobjective Electric Vehicle Charging Network Planning Considering Chance-Constraint on the Travel Distance for Charging." IET Electrical Systems in Transportation 2023 (November 17, 2023): 1–13. http://dx.doi.org/10.1049/2023/6690544.

Full text

Abstract:

Electric vehicle charging stations (EVCSs) are important infrastructures to support sustainable development of electric vehicles (EVs), by providing convenient, rapid charging services. Therefore, the planning of electric vehicle charging network (EVCN) has attracted wide interest from both industry and academia. In this paper, a multiobjective planning model for EVCN is developed, where a fixed number of EVCSs are planned in the traffic network (TN) to achieve two objectives, i.e., minimizing both average travel distance for charging (TDfC) of EVs and investment costs of EVCN. According to th

APA, Harvard, Vancouver, ISO, and other styles

26

Chen, Gonggui, Xingting Yi, Zhizhong Zhang, and Hangtian Lei. "Solving the Multi-Objective Optimal Power Flow Problem Using the Multi-Objective Firefly Algorithm with a Constraints-Prior Pareto-Domination Approach." Energies 11, no. 12 (2018): 3438. http://dx.doi.org/10.3390/en11123438.

Full text

Abstract:

Known as a multi-objective, large-scale, and complicated optimization problem, the multi-objective optimal power flow (MOOPF) problem tends to be introduced with many constraints. In this paper, compared with the frequently-used penalty function-based method (PFA), a novel constraint processing approach named the constraints-prior Pareto-domination approach (CPA) is proposed for ensuring non-violation of various inequality constraints on dependent variables by introducing the Pareto-domination principle based on the sum of constraint violations. Moreover, for solving the constrained MOOPF prob

APA, Harvard, Vancouver, ISO, and other styles

27

Brazeiro, Alejandro, Federico Haretche, Carolina Toranza, and Alexandra Cravino. "High Propagule Pressure and Patchy Biotic Resistance Control the Local Invasion Process of the Tree Ligustrum lucidum in a Subtropical Forest of Uruguay." Plants 14, no. 6 (2025): 873. https://doi.org/10.3390/plants14060873.

Full text

Abstract:

The tree Ligustrum lucidum (W. T. Aiton, Oleaceae), native to East Asia (China), has become an aggressive invader of subtropical and temperate forests around the world. To understand how its local small-scale spread is controlled, we studied (48 plots of 4 m−2), in a subtropical forest of Uruguay, the distribution and survival of seedlings, saplings, and poles to assess the effects of dispersal from mother trees (distance), microsite type (forest stands defined by dominant species), and past control measures. The propagule pressure of L. lucidum, estimated through seedlings density, was betwee

APA, Harvard, Vancouver, ISO, and other styles

28

Murphy, Patrick D. "Reducing the Dystopian Distance: Pseudo-Documentary Framing in Near-Future Fiction." Science Fiction Studies 17, Part 1 (1990): 25–40. https://doi.org/10.1525/sfs.17.1.025.

Full text

Abstract:

The ascendancy of dystopian over utopian visions in the course of the last 100 years or so has created a problem for the writers of such fictions. As dystopias have become commonplace, their subliminative dimension has increasingly triumphed over their cognitive function—which is to say that they tend to produce a cathartic elimination of anxiety rather than offering the kind of understanding that makes their readers want to act to change the world. Recently, certain authors of near-future dystopian fictions have addressed this problem of reducing the distance between fictive and empirical wor

APA, Harvard, Vancouver, ISO, and other styles

29

Cabaro, Jean Mansanadez, and Helen Rara. "Restrained 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (2022): 1047–53. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4451.

Full text

Abstract:

Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions. A set S ⊆ V (G) is a restrained 2-resolving dominating set in G if S is a 2-resolving dominating set in G and S = V (G) or ⟨V (G)\S⟩ has no isolated vertex. The restrained 2R-domination number of G, denoted by γr2R(G), is the smallest cardinality of a restrained 2-resolving dominating set in G. Any restrained 2-resolving dominating set of card

APA, Harvard, Vancouver, ISO, and other styles

30

Gispert-Fernández, Adrià, and Juan Alberto Rodríguez-Velázquez. "The equidistant dimension of graphs: NP-completeness and the case of lexicographic product graphs." AIMS Mathematics 9, no. 6 (2024): 15325–45. http://dx.doi.org/10.3934/math.2024744.

Full text

Abstract:

<abstract><p>Let $ V(G) $ be the vertex set of a simple and connected graph $ G $. A subset $ S\subseteq V(G) $ is a distance-equalizer set of $ G $ if, for every pair of vertices $ u, v\in V(G)\setminus S $, there exists a vertex in $ S $ that is equidistant to $ u $ and $ v $. The minimum cardinality among the distance-equalizer sets of $ G $ is the equidistant dimension of $ G $, denoted by $ \xi(G) $. In this paper, we studied the problem of finding $ \xi(G\circ H) $, where $ G\circ H $ denotes the lexicographic product of two graphs $ G $ and $ H $. The aim was to express $ \x

APA, Harvard, Vancouver, ISO, and other styles

31

Ray, Rajat Kanta. "Asian Capital in the Age of European Domination: The Rise of the Bazaar, 1800–1914." Modern Asian Studies 29, no. 3 (1995): 449–554. http://dx.doi.org/10.1017/s0026749x00013986.

Full text

Abstract:

There was a time when the economic confrontation between East and West was perceived as a confrontation between Gemeinschaft and Gesellschaft. ‘East is East and West is West, and never the twain shall meet,’—thus wrote J. H. Boeke, quoting Rudyard Kipling with warm approval. The notion has since been undermined by deeper explorations into the history of the Chinese and Indian merchant bankers, and the Jews of the Islamic world. Over large parts of Java, with which Boeke was most familiar, there was indeed a sharp contrast between the local communal economy and the sophisticated capitalism of t

APA, Harvard, Vancouver, ISO, and other styles

32

Liu, Ruochen, Minlei Xue, and Haoyuan Lv. "Adaptive Feature Weights Based Double-Layer Multi-Objective Method for SAR Image Segmentation." Remote Sensing 14, no. 5 (2022): 1117. http://dx.doi.org/10.3390/rs14051117.

Full text

Abstract:

The recently proposed multi-objective clustering methods convert the segmentation problem to a multi-objective optimization problem by extracting multiple features from an image to be segmented as clustering data. However, most of these methods fail to consider the impacts of different features on segmentation results when calculating the similarity using the Euclidean distance. In this paper, feature domination is defined to segment the image efficiently, and then an adaptive feature weights based double-layer multi-objective method (AFWDLMO) for image segmentation is presented. The proposed

APA, Harvard, Vancouver, ISO, and other styles

33

Wang, Xinnian, Keyi Xing, Chao-Bo Yan, and Mengchu Zhou. "A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems." Complexity 2019 (June 2, 2019): 1–14. http://dx.doi.org/10.1155/2019/5734149.

Full text

Abstract:

This paper considers the multiobjective scheduling of flexible manufacturing systems (FMSs). Due to high degrees of route flexibility and resource sharing, deadlocks often exhibit in FMSs. Manufacturing tasks cannot be finished if any deadlock appears. For solving such problem, this work develops a deadlock-free multiobjective evolutionary algorithm based on decomposition (DMOEA/D). It intends to minimize three objective functions, i.e., makespan, mean flow time, and mean tardiness time. The proposed algorithm can decompose a multiobjective scheduling problem into a certain number of scalar su

APA, Harvard, Vancouver, ISO, and other styles

34

Śmiałowski, Piotr. "Różne przejawy cenzury wobec serialu Dom Jana Łomnickiego." Images. The International Journal of European Film, Performing Arts and Audiovisual Communication 37, no. 46 (2024): 245–59. https://doi.org/10.14746/i.2024.37.46.14.

Full text

Abstract:

The historical series Home (1980–2000), which took 20 years in the making, provides excellent material for analyzing how censorship functioned at sensitive moments in history. The first seven episodes of Home were created before August 1980, the next five during the period of Solidarity domination and after the introduction of martial law. Although the temporal distance is small, it is clear that the episodes shot in the 1980s belong to three different eras. In the article, I compare two groups of sources regarding the censorship of this series. On the one hand, I refer to the documents prepar

APA, Harvard, Vancouver, ISO, and other styles

35

Whitfield, Alan, and Steven Weerts. "Fish species, families and guilds recorded in selected estuaries of Mozambique." Western Indian Ocean Journal of Marine Science 23, no. 1 (2024): 53–67. http://dx.doi.org/10.4314/wiojms.v23i1.6.

Full text

Abstract:

This review documents the occurrence of fish species in a range of estuaries from Mozambique. Altogether 217 fish species were recorded, belonging to 77 families, and dominated in terms of species richness by Gobiidae, Carangidae and Mugilidae. A guild analysis was conducted to compare the occurrence and degree of estuary-association by the various species in tropical Mozambique, with that recorded from nearby predominantly subtropical and warm-temper- ate estuaries in South Africa. The major difference in guild occurrence between the two coun- tries centered on the higher representation of ma

APA, Harvard, Vancouver, ISO, and other styles

36

Chen, Yanzhan, and Fan Yu. "A Novel Simulation-Based Optimization Method for Autonomous Vehicle Path Tracking with Urban Driving Application." Mathematics 11, no. 23 (2023): 4762. http://dx.doi.org/10.3390/math11234762.

Full text

Abstract:

Autonomous driving technology heavily depends on accurate and smooth path tracking. Facing complex urban driving scenarios, developing a suite of high-performance and robust parameters for controllers becomes imperative. This paper proposes a stochastic simulation-based optimization model for optimizing the Proportional–Integral–Differential (PID) controller parameters, with tracking accuracy and smoothness as bi-objectives, and solves it using a domination-measure-based efficient global optimization (DMEGO) algorithm. In this model, the tracking accuracy and smoothness are indexed by the norm

APA, Harvard, Vancouver, ISO, and other styles

37

Cabaro, Jean Mansanadez, and Helen Rara. "On 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (2022): 1417–25. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4426.

Full text

Abstract:

Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions. A 2-resolving set S ⊆ V (G) which isdominating is called a 2-resolving dominating set or simply 2R-dominating set in G. The minimum cardinality of a 2-resolving dominating set in G, denoted by γ2R(G), is called the 2R-domination number of G. Any 2R-dominating set of cardinality γ2R(G) is then referred to as a γ2R-set in G. This study deals wit

APA, Harvard, Vancouver, ISO, and other styles

38

Berland, Jody. "Attending the Giraffe." Humanimalia 9, no. 1 (2017): 22–45. http://dx.doi.org/10.52537/humanimalia.9612.

Full text

Abstract:

In this article I compare the story of the first contact tribute giraffe sent from Bengal to China in 1414 with the story of April, the famously web-cam pregnant giraffe of 2017. Both giraffes were transported by new technologies that brought together geographically dispersed people through a notable event. Both giraffes had to be conveyed from natural habitats into confinement, from distance into quasi-intimacy with European and global observers, from matriarchal family structure into an individual with a face that could at least hypothetically look back at its human viewer. The space between

APA, Harvard, Vancouver, ISO, and other styles

39

Mujica Johnson, Felipe. "Relaciones de la pedagógica y la pedagogía de la liberación latinoamericana. Estudio epistemológico basado en Dussel y Freire." Revista Ensayos Pedagógicos 19, no. 2 (2024): 1–17. http://dx.doi.org/10.15359/rep.19-2.1.

Full text

Abstract:

In the last decades, new epistemological discussions have been developed to support Latin American pedagogies that distance themselves from the hegemonic discourses of modernity and their colonial accent. In this context, this essay aims to contribute to the understanding of some of the relationships between Enrique Dussel’s pedagogy and Paulo Freire’s pedagogy of liberation. In the first section that contributes to this objective, the three chapters of Dussel’s book La pedagógica latinoamericana and the first two chapters of Freire’s book Pedagogy of the Opressed are presented. From Dussel’s

APA, Harvard, Vancouver, ISO, and other styles

40

Adolfo, Niña Jeane, Imelda Aniversario, and Ferdinand Jamil. "Closed Geodetic Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 17, no. 3 (2024): 1618–36. http://dx.doi.org/10.29020/nybg.ejpam.v17i3.5241.

Full text

Abstract:

Let G be a simple, undirected and connected graph. A subset S ⊆ V (G) is a geodetic cover of G if IG[S] = V (G), where IG[S] is the set of all vertices of G lying on any geodesic between two vertices in S. A geodetic cover S of G is a closed geodetic cover if the vertices in S are sequentially selected as follows: Select a vertex v1 and let S1 = {v1}. If G is nontrivial, select a vertex v2 ̸= v1 and let S2 = {v1, v2}. Where possible, for i ≥ 3, successively select vertex vi ∈/ IG[Si−1] and let Si = {v1, v2, ..., vi}. Then there exists a positive integer k such that Sk = S. A geodetic cover S o

APA, Harvard, Vancouver, ISO, and other styles

41

Ciugureanu, Adina. "HYBRID SPACES IN THE MODERN CITY: DUBLIN AND BUCHAREST IN THE EARLY TWENTIETH CENTURY." SWS Journal of SOCIAL SCIENCES AND ART 1, no. 1 (2019): 55–66. http://dx.doi.org/10.35603/ssa2019/issue1.06.

Full text

Abstract:

This article aims at looking at two centres of modernity, seen in space, time and metaphorical representation, in the early twentieth century as illustrated by the Irish writer James Joyce in Ulysses (1922) and the Romanian novelist Cezar Petrescu in Calea Victoriei [“Victory Avenue”], published in 1929. The analysis is based on recent research that has entangled the representation of space in cultural and fictional texts with the geographic spaces of the respective historical periods, the reason being that, since time and space are not to be severed, nor are history or geography. The theoreti

APA, Harvard, Vancouver, ISO, and other styles

42

Umilasari, Reni, and Darmaji Darmaji. "Dominating number of distance two of corona products of graphs." Indonesian Journal of Combinatorics 1, no. 1 (2016): 41. http://dx.doi.org/10.19184/ijc.2016.1.1.5.

Full text

Abstract:

<p>Dominating set $S$ in graph $G=(V,E)$ is a subset of $V(G)$ such that every vertex of $G$ which is not element of $S$ are connected and have distance one to $S$. Minimum<span style="text-decoration: underline;"> cardinality</span> among dominating sets in a graph $G$ is called dominating number of graph $G$ and denoted by $\gamma(G)$. While dominating set ofdistance two which denoted by $S_2$ is a subset of $V(G)$ such that every vertex of $G$ which is not element of $S$ are connected and have maximum distance two to $S_2$. Dominating number of distance two $\gamma_2(G)$ i

APA, Harvard, Vancouver, ISO, and other styles

43

Kullaa, Rinna. "The Soviet Union's global ports and flexible web-like naval strategy: Case studies of Antsiranana and Tivat." International Journal of Maritime History 33, no. 1 (2021): 209–31. http://dx.doi.org/10.1177/0843871421991163.

Full text

Abstract:

This article contributes to the history of the Soviet Union and global naval history by comparing two examples of naval ports across the European and African continents: Tivat in Yugoslavia and Antsiranana in Madagascar. Comparison of the utilization and construction of these ports reveals how the Soviet network of naval ports did not display a singular rationale, but rather featured a global spider’s-web-like quality. The most marked quality of the Soviet Union's approach to naval construction was the use of nuclear carriers as a flexible tool of geographic and political aims. The goals of So

APA, Harvard, Vancouver, ISO, and other styles

44

Dolnicki, Piotr, and Paweł Kroh. "Skład frakcjonalny stożków gruzowych w kontekście zróżnicowanego klimatu peryglacjalnych stoków górskich (na przykładzie Spitsbergenu i środkowej Azji) = Grain-Size Composition on Talus Slopes in the context of disparate climatic conditions of periglacial mountain zones (exemplified by Spitsbergen and Central Asia)." Przegląd Geograficzny 94, no. 4 (2022): 437–50. http://dx.doi.org/10.7163/przg.2022.4.2.

Full text

Abstract:

Talus slopes origin is connected both with weathering and transport of the rock grain. The formation of these landforms is an effect of many climatological, morphological and geological factors. The grain size of the surface of the talus slope brings some information about the way of transport and deposition mechanisms. The main aim of the paper is to present different talus slope formation in two mountain locations - in arctic periglacial and semi-arid continental periglacial climate zones. Results from two study sites are presented. The first one was located on Spitsbergen Island, on its SW

APA, Harvard, Vancouver, ISO, and other styles

45

Fonju, Dr Njuafac Kenedy. "The Origins of 113 Years of Triple Brutal Pre-Colonial and Colonial Confusions (TBPCC) Under 58 Diplomatic Agents of Exploration, Expropriation and Exploitations (3Es) in the Togoland of the African Gulf of Guinea( TAGG) 1847-1960." Cross-Currents: An International Peer-Reviewed Journal on Humanities & Social Sciences 8, no. 7 (2022): 97–109. http://dx.doi.org/10.36344/ccijhss.2022.v08i07.002.

Full text

Abstract:

The main focus of this paper deals with the triple colonial confusions in the Togoland with principal actors and agents from Germany, France and Britain spanning from the mid-19th to mid-20th Centuries. The activities of the Western diplomatic agents totaled 58 in different portfolios within 113 years from 1847 to 1960. The first period from 1847 to 1883 was not having any ranking agents but scattered commercial men and explorers by the Germans and other Europeans before the German final claimed. The second started from the Berlin Colonial Conference (BCC) of November 1884 - February 1885 with

APA, Harvard, Vancouver, ISO, and other styles

46

Burgess, Treena, and Bernie Dell. "Changes in protein biosynthesis during the differentiation of Pisolithus – Eucalyptus grandis ectomycorrhiza." Canadian Journal of Botany 74, no. 4 (1996): 553–60. http://dx.doi.org/10.1139/b96-070.

Full text

Abstract:

Protein biosynthesis in Pisolithus – Eucalyptus grandis ectomycorrhiza was related to the stage of ectomycorrhizal development using two-dimensional polyacrylamide gel electrophoresis of proteins labelled by in vivo incorporation of 35S radiolabelled amino acids. Nineteen-day-old seedlings were radiolabelled and the primary root was divided into 1-cm segments. With increasing distance from the tip of the primary root, the lateral roots developed as follows: segment 1, no lateral tips; segment 2, three lateral tips, 1–4 days old; segment 3, five lateral tips, 3–8 days old; segment 4, five later

APA, Harvard, Vancouver, ISO, and other styles

47

AZHNIUK, B. M. "LANGUAGE POLICY IN UKRAINE AND THE PROSPECTS OF EUROPEAN INTEGRATION." Movoznavstvo 327, no. 6 (2022): 15–33. http://dx.doi.org/10.33190/0027-2833-327-2022-6-002.

Full text

Abstract:

The paper discusses the current state and the prospects of language planning and language policy in Ukraine from the perspective of their conformity with the European language ideologies, sociolinguistic principles and practical approaches. Since late 20th century language policy in Ukraine has been determined by the battle of two antagonistic language ideologies: 1) advocating the spread of Ukrainian into public spheres from which it was ousted or denied access to by the centuries of imperial domination and 2) conservation of colonial legacy accompanied by appeals to western-type liberal valu

APA, Harvard, Vancouver, ISO, and other styles

48

Liordos, Vasilios, Vasileios J. Kontsiotis, Ioanna Eleftheriadou, Stylianos Telidis, and Archimidis Triantafyllidis. "Wildlife Value Orientations and Demographics in Greece." Earth 2, no. 3 (2021): 457–67. http://dx.doi.org/10.3390/earth2030027.

Full text

Abstract:

Value orientations can predict attitudes and possibly behaviors. Wildlife value orientations (WVOs) are useful constructs for predicting differences in attitudes among segments of the public towards issues in the wildlife domain. We carried out face-to-face interviews with a representative sample of the Greek population (n = 2392) to investigate two basic WVOs, domination and mutualism and the four WVO types that result from their combination: traditionalist (high domination, low mutualism), mutualist (high mutualism, low domination), distanced (low mutualism, low domination) and pluralist (hi

APA, Harvard, Vancouver, ISO, and other styles

49

Drianus, Oktarizal. "Emansipasi Intelektual Jacques Rancière." Tawshiyah: Jurnal Sosial Keagaman dan Pendidikan Islam 14, no. 1 (2019): 62–84. http://dx.doi.org/10.32923/taw.v14i1.1036.

Full text

Abstract:

This paper aims to show at once critics and solutions for the logic of critical education, which has recently been sporadically appropriated by educational institutions and communities in Indonesia. This paper uses the method of library research with primary sources, namely: The Ignorant Schoolmaster: Five Lessons in Intellectual Emancipation by Jacques Rancière. Findings shed light on several things, namely: 1) Rancière's critics of critical education which perpetuates the paradox of equality; 2) The experience of “the teacher who did not know”, Josep Jacotot who accidentally found a way of l

APA, Harvard, Vancouver, ISO, and other styles

50

Lewis, Frederick D. "DNA photonics." Pure and Applied Chemistry 78, no. 12 (2006): 2287–95. http://dx.doi.org/10.1351/pac200678122287.

Full text

Abstract:

Short DNA duplexes can be stabilized by the presence of organic chromophores, which serve as hairpin linkers or end-capping groups. Capped hairpins possessing one or more base pairs form stable folded structures in aqueous solution. Increasing the number of base pairs separating the two chromophores increases both the distance between the two chromophores and the dihedral angle between their electronic transition dipoles. Thus, duplex DNA can serve as a helical scaffold for the study of electronic interactions between two chromophores. Three types of electronic interaction have been investigat

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!