Gotowe bibliografie tematyczne / Signed domination

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Signed domination”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Signed domination”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Signed domination"

Joseph, James, and Mayamma Joseph. "On domination in signed graphs." Acta Universitatis Sapientiae, Informatica 15, no. 1 (2023): 1–9. http://dx.doi.org/10.2478/ausi-2023-0001.

Pełny tekst źródła

Streszczenie:

Abstract In this article the concept of domination in signed graphs is examined from an alternate perspective and a new definition of the same is introduced. A vertex subset D of a signed graph S is a dominating set, if for each vertex v not in D there exists a vertex u ∈ D such that the sign of the edge uv is positive. The domination number γ (S) of S is the minimum cardinality among all the dominating sets of S. We obtain certain bounds of γ (S) and present a necessary and su cient condition for a dominating set to be a minimal dominating set. Further, we characterise the signed graphs havin

Style APA, Harvard, Vancouver, ISO itp.

Mathias, Anisha Jean, V. Sangeetha, and Mukti Acharya. "Restrained domination in signed graphs." Acta Universitatis Sapientiae, Mathematica 12, no. 1 (2020): 155–63. http://dx.doi.org/10.2478/ausm-2020-0010.

Pełny tekst źródła

Streszczenie:

AbstractA signed graph Σ is a graph with positive or negative signs attatched to each of its edges. A signed graph Σ is balanced if each of its cycles has an even number of negative edges. Restrained dominating set D in Σ is a restrained dominating set of its underlying graph where the subgraph induced by the edges across Σ[D : V \ D] and within V \ D is balanced. The set D having least cardinality is called minimum restrained dominating set and its cardinality is the restrained domination number of Σ denoted by γr(Σ). The ability to communicate rapidly within the network is an important appli

Style APA, Harvard, Vancouver, ISO itp.

Patil, Dr. Mallikarjun S. "A study on signed domination in graphs in present context – A theoretical assimilation." International Journal of Advance and Applied Research 4, no. 33 (2023): 97–104. https://doi.org/10.5281/zenodo.10153459.

Pełny tekst źródła

Streszczenie:

Abstract:The study of signed domination in graphs has gained significant attention in recent years, owing to its relevance in various real-world applications, including social networks, communication systems, and optimization problems. In this research article, we provide a contemporary overview of signed domination in graphs, focusing on its current context and emerging trends. Signed domination, a generalization of classical domination in graph theory, involves assigning positive or negative weights to vertices in a graph. A set of vertices is said to be a signed dominating

Style APA, Harvard, Vancouver, ISO itp.

Almulhim, Ahlam. "Signed double Italian domination." AIMS Mathematics 8, no. 12 (2023): 30895–909. http://dx.doi.org/10.3934/math.20231580.

Pełny tekst źródła

Streszczenie:

<abstract>A signed double Italian dominating function (SDIDF) on a graph $ G = (V, E) $ is a function $ f $ from $ V $ to $ \{-1, 1, 2, 3\} $, satisfying (ⅰ) $ \sum_{u\in N[v]}f(u)\ge1 $ for all $ v\in V $; (ⅱ) if $ f(v) = -1 $ for some $ v\in V $, then there exists $ A\subseteq N(v) $ such that $ \sum_{u\in A}f(u)\ge3 $; and (ⅲ) if $ f(v) = 1 $ for some $ v\in V $, then there exists $ A\subseteq N(v) $ such that $ \sum_{u\in A}f(u)\ge2 $. The weight of an SDIDF $ f $ is $ \sum_{v\in V}f(v) $. The signed double Italian domination number of $ G $ is the minimum weight of an SDIDF

Style APA, Harvard, Vancouver, ISO itp.

Ghameshlou, Arezoo N., Athena Shaminezhad, Ebrahim Vatandoost, and Abdollah Khodkar. "Signed domination and Mycielski’s structure in graphs." RAIRO - Operations Research 54, no. 4 (2020): 1077–86. http://dx.doi.org/10.1051/ro/2019109.

Pełny tekst źródła

Streszczenie:

Let G = (V, E) be a graph. The function f : V(G) → {−1, 1} is a signed dominating function if for every vertex v ∈ V(G), ∑x∈NG[v] f(x)≥1. The value of ω(f) = ∑x∈V(G) f(x) is called the weight of f. The signed domination number of G is the minimum weight of a signed dominating function of G. In this paper, we initiate the study of the signed domination numbers of Mycielski graphs and find some upper bounds for this parameter. We also calculate the signed domination number of the Mycielski graph when the underlying graph is a star, a wheel, a fan, a Dutch windmill, a cycle, a path or a complete

Style APA, Harvard, Vancouver, ISO itp.

Dehgardi, Nasrin, Maryam Atapour, and Abdollah Khodkar. "Twin signed k-domination numbers in directed graphs." Filomat 31, no. 20 (2017): 6367–78. http://dx.doi.org/10.2298/fil1720367d.

Pełny tekst źródła

Streszczenie:

Let D = (V;A) be a finite simple directed graph (digraph). A function f : V ? {-1,1} is called a twin signed k-dominating function (TSkDF) if f (N-[v]) ? k and f (N+[v]) ? k for each vertex v ? V. The twin signed k-domination number of D is ?* sk(D) = min{?(f)?f is a TSkDF of D}. In this paper, we initiate the study of twin signed k-domination in digraphs and present some bounds on ?* sk(D) in terms of the order, size and maximum and minimum indegrees and outdegrees, generalising some of the existing bounds for the twin signed domination numbers in digraphs and the signed k-domination numbers

Style APA, Harvard, Vancouver, ISO itp.

Xu, Baogen, Mengmeng Zheng, and Ting Lan. "On Non-Zero Vertex Signed Domination." Symmetry 15, no. 3 (2023): 741. http://dx.doi.org/10.3390/sym15030741.

Pełny tekst źródła

Streszczenie:

For a graph G=(V,E) and a function f:V→{−1,+1}, if S⊆V then we write f(S)=∑v∈Sf(v). A function f is said to be a non-zero vertex signed dominating function (for short, NVSDF) of G if f(N[v])=0 holds for every vertex v in G, and the non-zero vertex signed domination number of G is defined as γsb(G)=max{f(V)|f is an NVSDF of G}. In this paper, the novel concept of the non-zero vertex signed domination for graphs is introduced. There is also a special symmetry concept in graphs. Some upper bounds of the non-zero vertex signed domination number of a graph are given. The exact value of γsb(G) for s

Style APA, Harvard, Vancouver, ISO itp.

Sheikholeslami, Seyed Mahmoud, Rana Khoeilar, and Leila Asgharsharghi. "Signed strong Roman domination in graphs." Tamkang Journal of Mathematics 48, no. 2 (2017): 135–47. http://dx.doi.org/10.5556/j.tkjm.48.2017.2240.

Pełny tekst źródła

Streszczenie:

Let $G=(V,E)$ be a finite and simple graph of order $n$ and maximum degree $\Delta$. A signed strong Roman dominating function (abbreviated SStRDF) on a graph $G$ is a function $f:V\to \{-1,1,2,\ldots,\lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the conditions that (i) for every vertex $v$ of $G$, $\sum_{u\in N[v]} f(u)\ge 1$, where $N[v]$ is the closed neighborhood of $v$ and (ii) every vertex $v$ for which $f(v)=-1$ is adjacent to at least one vertex $u$ for which $f(u)\ge 1+\lceil\frac{1}{2}|N(u)\cap V_{-1}|\rceil$, where $V_{-1}=\{v\in V \mid f(v)=-1\}$. The minimum of the values $\sum_{v\

Style APA, Harvard, Vancouver, ISO itp.

Xu, Baogen, Ting Lan, and Mengmeng Zheng. "A Note on the Signed Clique Domination Numbers of Graphs." Journal of Mathematics 2022 (September 17, 2022): 1–6. http://dx.doi.org/10.1155/2022/3208164.

Pełny tekst źródła

Streszczenie:

Let G = V , E be a graph. A function f : E ⟶ − 1 , + 1 is said to be a signed clique dominating function (SCDF) of G if ∑ e ∈ E K f e ≥ 1 holds for every nontrivial clique K in G . The signed clique domination number of G is defined as γ scl ′ G = min ∑ e ∈ E G f e | f is an SCDF of G . In this paper, we investigate the signed clique domination numbers of join of graphs. We correct two wrong results reported by Ao et al. (2014) and Ao et al. (2015) and determine the exact values of the signed clique domination numbers of P m ∨ K n ¯ and C m ∨ K n .

Style APA, Harvard, Vancouver, ISO itp.

Wang, Haichao, and Hye Kyung Kim. "Signed Domination Number of the Directed Cylinder." Symmetry 11, no. 12 (2019): 1443. http://dx.doi.org/10.3390/sym11121443.

Pełny tekst źródła

Streszczenie:

In a digraph D = ( V ( D ) , A ( D ) ) , a two-valued function f : V ( D ) → { - 1 , 1 } defined on the vertices of D is called a signed dominating function if f ( N - [ v ] ) ≥ 1 for every v in D. The weight of a signed dominating function is f ( V ( D ) ) = ∑ v ∈ V ( D ) f ( v ) . The signed domination number γ s ( D ) is the minimum weight among all signed dominating functions of D. Let P m × C n be the Cartesian product of directed path P m and directed cycle C n . In this paper, the exact value of γ s ( P m × C n ) is determined for any positive integers m and n.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Signed domination"

Liu, Pei-Yuan, and 劉培源. "Signed domination and efficient signed domination on cographs." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/57226526534281008711.

Pełny tekst źródła

Streszczenie:

碩士 國立中正大學 資訊工程研究所 89 A signed dominating function of a graph G = (V, E) is defined as a function f : V -> {-1, 1} such that sum (s in N[v] f(s)) > = 1, where N[v] consists of v and every vertex adjacent to v. We say a signed dominating function f is an efficient signed dominating function if the closed neighborhood sum is exactly 1 at every vertex. These two problems are NP-complete for general graphs, hence we focus on cographs. A graph is called a cograph if it does not contain a path linking four vertices as an induced subgraph. In this thesis, we present two O(n5) al

Style APA, Harvard, Vancouver, ISO itp.

Gong, Hsin-Ju, and 龔欣如. "Signed Domination in Block Graphs." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/95802035053932637299.

Pełny tekst źródła

Streszczenie:

碩士 國立中央大學 數學研究所 92 In this thesis, we study the signed domination problem from an algorithmic point of view. In particular, we present some linear algorithms for finding the signed domination numbers of some special block graphs, such as block path and good block graph that every block of G has at least one vertex which is not a cut-vertex of G.

Style APA, Harvard, Vancouver, ISO itp.

Ungerer, Elna. "Aspects of signed and minus domination in graphs." Thesis, 2012. http://hdl.handle.net/10210/6640.

Pełny tekst źródła

Streszczenie:

Ph.D. In Chapter 1 we will give a brief historical account of domination theory and define the necessary concepts which we use in the remainder of the thesis. In Chapter 2 we establish a lower bound for the minus k-subdomination number of trees and characterize those trees which achieve this lower bound. We also compute the value of Yks-101 for comets and for cycles. We then show that the decision problem corresponding to the computation of Yks-101 is NP-complete, even for bipartite graphs. In Chapter 3 we characterize those trees T which achieve the lower bound of Cockayne and Mynhardt, th

Style APA, Harvard, Vancouver, ISO itp.

LO, CHENG-CHIEN, and 羅政謙. "On the Complexity of Some Variations of Minus Domination and Signed Domination in Graphs." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/40314646982330765238.

Pełny tekst źródła

Streszczenie:

碩士 銘傳大學 資訊傳播工程學系碩士班 104 A minus (respectively, signed) dominating function of a graph G = (V, E) is a function f：V → {-1, 0, 1} (respectively, {-1, 1}) such that Σu∈N_G[v] f(u) ≥ 1 for all v ∈ V , where N_G [v] = {v}⋃{u|(u, v) ∈ E}. The weight of a minus (respectively, signed) dominating function of G is the sum of its function values over all vertices. The minus respectively, signed) domination problem is to find a minus (respectively, signed) dominating function of G of minimum weight. In this thesis, we study some variations of the signed domination and minus domination problems

Style APA, Harvard, Vancouver, ISO itp.

Chen, Min-Ling, and 陳旻琳. "A Study of Signed Domination Number of Torus Graphs." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/50507851958094276674.

Pełny tekst źródła

Streszczenie:

碩士 國立東華大學 資訊工程學系 101 Let G = (V;E) be a simple graph. A signed dominating function assigns 1 and -1 to each vertex such that the sum of the assigned values of the closed neighborhood of vertex v for each vertices for graph is more than 0. The signed domination number is the minimum sum among all possible signed dominating functions. In this thesis, we give some lower and upper bounds of the signed domination number for a torus graph. In particular, for some cases, our upper bounds are optimal.

Style APA, Harvard, Vancouver, ISO itp.

Lin, Jin Yong, and 林晉永. "Algorithms and Hardness for Signed and Minus Domination Problems." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/47298793310654873664.

Pełny tekst źródła

Streszczenie:

碩士 國立清華大學 資訊工程學系 103 A {\em domination problem} in graph theorem is that in given graph, we choose some vertices or edges, or assign values to vertices such that the graph can accord with the rule of the problem. In this paper, we study the algorithms and hardness for {\em Signed domination (SD) problem} and {\em Minus domination (MD) problem}. The singed domination problem is that we assign value $\{-1,+1\}$ to all vertices, the minus domination problem is that we assign value $\{-1,0,+1\}$ to all vertices, both of two problems ask that for all vertices, the sum value of the verte

Style APA, Harvard, Vancouver, ISO itp.

PAYAL. "ON SIGNED PETRI NETS." Thesis, 2023. http://dspace.dtu.ac.in:8080/jspui/handle/repository/20370.

Pełny tekst źródła

Streszczenie:

In today’s complex scenario of technological advancement, the role of event-driven discrete dynamical systems have an impact on man’s ability to fast-forward the futuristic technologies that are likely to bring unimaginable progress in our time, and near, far futures. One such great innovation that inspired this thesis is the "Theory of Petri nets", a modeling tool for event-driven discrete dynamical systems. The study of Petri nets and its various extensions that have developed over time is one of the most active and vibrant areas of research in current time, owing to its applications

Style APA, Harvard, Vancouver, ISO itp.

Chiu, Yu-Chieh, and 邱鈺傑. "Self-stabilizing minimal dominating set algorithms of distributed systems and the signed star domination number of Cayley graphs." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/28741059665723204862.

Pełny tekst źródła

Streszczenie:

博士 國立交通大學 應用數學系所 102 The study of the domination problem in graph theory began in the nineteen-sixties. A distributed system such as an ad hoc network can be modeled by an undirected simple graph G = (V;E), where V represents the set of nodes (i.e., processes) and E represents the set of interconnections between processes of the distributed system. A subset D of the vertex set V of G is a dominating set if each vertex v in V is either a member of D or adjacent to a vertex in D. A dominating set of G is a minimal dominating set (MDS) if none of its proper subsets is a dominating set

Style APA, Harvard, Vancouver, ISO itp.

王奕倫. "Signed star domination and signed star domatic numbers of complete bipartite graphs and an improved algorithm for network planarization." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/02364217719187379697.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Signed domination"

Rodrigues da Silva, Renato. The Anglo-Saxon Elite. Amsterdam University Press, 2021. http://dx.doi.org/10.5117/9789463721134.

Pełny tekst źródła

Streszczenie:

In all of the literature on Anglo-Saxon England, rarely has the question of social class been confronted head-on. This study draws upon recent research into topics such as religious practice, emotions, daily life, and intellectual culture to investigate how the aristocracy of Northumbria maintained social dominance over wider society. Moreover, this monograph suggests that the crisis that brought an end to Northumbria as an independent kingdom was the product of the social contradictions produced by the ruling class as social domination developed over time. The analysis is divided into three b

Style APA, Harvard, Vancouver, ISO itp.

L, James E. Fifty Shades of Grey 10th Anniversary Signed Edition. Sourcebooks, Incorporated, 2022.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Meranze, Michael. Histories of the Modern Prison. Edited by Paul Knepper and Anja Johansen. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199352333.013.35.

Pełny tekst źródła

Streszczenie:

This essay examines the history of the prison since late the eighteenth century. Following a discussion of the origins of the reformative prison, the essay analyzes its global expansion as a tool for disciplining populations, expanding imperial control, and establishing national legitimacy. In particular, it emphasizes the dialectic between colonial and national projects and the multiple uses that the prison has come to play in states around the globe. From its origins as a local response to particular issues of crime and disruption, during the nineteenth century the prison became a sign of mo

Style APA, Harvard, Vancouver, ISO itp.

Hazzard-Donald, Katrina. The Demise of Dr. Buzzard. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252037290.003.0006.

Pełny tekst źródła

Streszczenie:

This chapter examines the black belt Hoodoo complex between the two world wars, with particular emphasis on the demise of Dr. Buzzard. Also known as Stepheney Robinson, Dr. Buzzard is Hoodoo's most famous conjurer. His conjure was free of exotic influences; he used only noncommercial products, he was a living link with the old plantation Hoodoo folk religion, and his life spanned Hoodoo development through several of its rapidly changing stages. This chapter discusses the diversification in spiritual merchandising in the period between World Wars I and II and how it contributed to an ever-stre

Style APA, Harvard, Vancouver, ISO itp.

Strijbos, Sytse. Systems Thinking. Edited by Robert Frodeman. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780198733522.013.24.

Pełny tekst źródła

Streszczenie:

Systems thinking was launched by Ludwig von Bertalanffy and others in the 1950s as an interdisciplinary movement with a broad and bold scientific program. The movement attempts to overcome the dominating mechanistic world picture and related reductionism in the sciences which is regarded as one of the main causes of the problems of the modern world. This chapter discusses the sixty-year history of systems thinking and sketches some main lines of its three domains: systems science, systems approach in technology and management, and systems philosophy. This interdisciplinary movement has stimula

Style APA, Harvard, Vancouver, ISO itp.

Bofill, Hèctor López. Nostalgic Empires. The Rowman & Littlefield Publishing Group, 2023. https://doi.org/10.5040/9781978723375.

Pełny tekst źródła

Streszczenie:

The present state of European integration finds its roots in the decolonization processes and the dissolution of empires in the past. Building upon this fundamental idea, this work presents a narrative that explores the Western European states’ struggle for national survival within the framework of European supranational structures. Hèctor López Bofill argues that the European Union, with its intricate legal framework, serves as a means to ensure national cohesion and social stability within its member states. Bofill identifies several sources of domination stemming from the combined actions o

Style APA, Harvard, Vancouver, ISO itp.

Inverse Problems and Zero Forcing for Graphs. American Mathematical Society, 2022.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Signed domination"

Zheng, Ying, Jianxin Wang, Qilong Feng, and Jianer Chen. "FPT Results for Signed Domination." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29952-0_53.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lin, Jin-Yong, and Sheung-Hung Poon. "Algorithms and Hardness for Signed Domination." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17142-5_38.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sundarakannan, M., and S. Arumugam. "Signed Cycle Domination in Planar Graphs." In Theoretical Computer Science and Discrete Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_52.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kang, Liying, and Erfang Shan. "Signed and Minus Dominating Functions in Graphs." In Topics in Domination in Graphs. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51117-3_9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lu, Chin Lung, Sheng-Lung Peng, and Chuan Yi Tang. "Efficient Minus and Signed Domination in Graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40996-3_21.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Ghameshlou, Arezoo N., and Athena Shaminezhad. "Signed Total Domination and Mycielski Structure in Graphs." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66514-6_11.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Li, Wensheng, Zhongsheng Huang, Zhifang Feng, Huaming Xing, and Yuejing Fang. "The Algorithmic Complexity of Reverse Signed Domination in Graphs." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34041-3_109.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hedetniemi, Stephen T., Alice A. McRae, and Raghuveer Mohan. "Algorithms and Complexity of Signed, Minus, and Majority Domination." In Developments in Mathematics. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58892-2_14.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zheng, Ying, Jianxin Wang, and Qilong Feng. "Kernelization and Lower Bounds of the Signed Domination Problem." In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38756-2_27.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Huang, Zhongsheng, Zhifang Feng, and Huaming Xing. "Inverse Signed Total Domination Numbers of Some Kinds of Graphs." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34041-3_45.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Signed domination"

Gao, Hong, Wei Duan, Tingting Feng, and Yuansheng Yang. "Signed Mixed Domination Number of Circulant Graphs." In 2019 International Conference on Electronic Engineering and Informatics (EEI). IEEE, 2019. http://dx.doi.org/10.1109/eei48997.2019.00113.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Liang, Zhipeng, and Jinxia Yang. "The signed domination number of generalized Sierpiński networks." In Second International Conference on Digital Signal and Computer Communications (DSCC 2022), edited by Sandeep Saxena. SPIE, 2022. http://dx.doi.org/10.1117/12.2641282.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zhifang Feng, Wensheng Li, Zhongsheng Huang, and Suwei Lu. "On local reverse signed edge domination in graphs." In 2011 International Conference on Multimedia Technology (ICMT). IEEE, 2011. http://dx.doi.org/10.1109/icmt.2011.6002682.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sun, Zongjian, and Jing Chen. "The network control system based on low signed domination number." In 2015 7th International Conference on Modelling, Identification and Control (ICMIC). IEEE, 2015. http://dx.doi.org/10.1109/icmic.2015.7409465.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Strauss, Olivier, and Agnes Rico. "Where the domination of maxitive kernels is extended to signed values." In 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2019. http://dx.doi.org/10.1109/fuzz-ieee.2019.8858814.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sabarish, B. A., B. Kailassh, Kirthana Baktha, and Y. Janaki. "Recommendations of location for facilities using domination set theory." In 2017 International Conference on Communication and Signal Processing (ICCSP). IEEE, 2017. http://dx.doi.org/10.1109/iccsp.2017.8286646.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sanguanpong, Saharath, та Nantapath Trakultraipruk. "Γ-induced-paired Dominating Graphs of Paths". У 2021 5th International Conference on Vision, Image and Signal Processing (ICVISP). IEEE, 2021. http://dx.doi.org/10.1109/icvisp54630.2021.00048.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tosun, Mustafa, and Orhan Dagdeviren. "Experimental Evaluation of Synchronous Distributed Dominating Set Algorithms." In 2019 27th Signal Processing and Communications Applications Conference (SIU). IEEE, 2019. http://dx.doi.org/10.1109/siu.2019.8806508.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Greetham, Danica Vukadinovic, Anush Poghosyan, and Nathaniel Charlton. "Weighted Alpha-Rate Dominating Sets in Social Networks." In 2014 Tenth International Conference on Signal-Image Technology & Internet-Based Systems (SITIS). IEEE, 2014. http://dx.doi.org/10.1109/sitis.2014.51.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gao, Jianhang, Qing Zhao, and Ananthram Swami. "Minimum information dominating set for critical sampling over graphs." In ICASSP 2015 - 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2015. http://dx.doi.org/10.1109/icassp.2015.7178512.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Signed domination"

Guizzo Altube, Matías, Carlos Scartascini, and Mariano Tommasi. The Political Economy of Redistribution and (in)Efficiency in Latin America and the Caribbean. Inter-American Development Bank, 2023. http://dx.doi.org/10.18235/0005239.

Pełny tekst źródła

Streszczenie:

Predominant views on the political economy of Latin America and the Caribbean tend to emphasize that elite domination helps to understand the high levels of inequality. The contemporary fiscal version of that assertion goes something like “the rich are powerful and they dont like taxes, hence we have little taxation and little redistribution.” That is a good approximation to the reality of some countries, but not of others. There are cases in the region where there are high levels of taxation and non-negligible redistributive efforts. But in some of those cases such redistribution comes hand i

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!