Relevant bibliographies by topics / Resolving connected dominating set

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Resolving connected dominating set'

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 lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Resolving connected dominating set.'

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.

Journal articles on the topic "Resolving connected dominating set"

1

Mahistrado, Angelica Mae, and Helen Rara. "Outer-Connected 2-Resolving Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 16, no. 2 (2023): 1180–95. http://dx.doi.org/10.29020/nybg.ejpam.v16i2.4771.

Full text
Abstract:
. Let G be a connected graph. A set S ⊆ V (G) is an outer-connected 2-resolving hop dominating set of G if S is a 2-resolving hop dominating set of G and S = V (G) or the subgraph ⟨V (G)\S⟩ induced by V (G)\S is connected. The outer-connected 2-resolving hop domination number of G, denoted by γ^c2Rh(G) is the smallest cardinality of an outer-connected 2-resolving hop dominating set of G. This study aims to combine the concept of outer-connected hop domination with the 2-resolving hop dominating sets of graphs. The main results generated in this study include the characterization of outer-conne
APA, Harvard, Vancouver, ISO, and other styles
2

Hausawi, Yasser M., Zaid Alzaid, Olayan Alharbi, Badr Almutairi, and Basma Mohamed. "COMPUTING THE SECURE CONNECTED DOMINANT METRIC DIMENSION PROBLEM OF CLASSES OF GRAPHS." Advances and Applications in Discrete Mathematics 42, no. 3 (2025): 219–33. https://doi.org/10.17654/0974165825015.

Full text
Abstract:
This paper investigates the NP-hard problem of finding the lowest secure connected domination metric dimension of graphs. If each vertex in can be uniquely recognized by its vector of distances to the vertices in Scddim, then every vertex set Scddim of a connected graph resolves . If the subgraph induced by Scddim is a nontrivial connected subgraph of , then the resolving set Scddim of is connected. That resolving set is dominating if each vertex in that is not an element of Scddim is a neighbor of some vertices in Scddim. If there is a in such that is a dominating set for any in , then the do
APA, Harvard, Vancouver, ISO, and other styles
3

Monsanto, Gerald Bacon, and Helen M. Rara. "Resolving Restrained Domination in Graphs." European Journal of Pure and Applied Mathematics 14, no. 3 (2021): 829–41. http://dx.doi.org/10.29020/nybg.ejpam.v14i3.3985.

Full text
Abstract:
Let G be a connected graph. Brigham et al. [3] defined a resolving dominating setas a set S of vertices of a connected graph G that is both resolving and dominating. A set S ⊆ V (G) is a resolving restrained dominating set of G if S is a resolving dominating set of G and S = V (G) or hV (G) \ Si has no isolated vertex. In this paper, we characterize the resolving restrained dominating sets in the join, corona and lexicographic product of graphs and determine the resolving restrained domination number of these graphs.
APA, Harvard, Vancouver, ISO, and other styles
4

Monsanto, Gerald Bacon, Penelyn L. Acal, and Helen M. Rara. "Strong Resolving Domination in the Lexicographic Product of Graphs." European Journal of Pure and Applied Mathematics 16, no. 1 (2023): 363–72. http://dx.doi.org/10.29020/nybg.ejpam.v16i1.4652.

Full text
Abstract:
Let G be a connected graph. A subset S ⊆ V (G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v ∈ V (G), there exists a vertex w ∈ S such that u ∈ IG[v, w] or IG[u, w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the lexicographic product of graphs and determine the corresponding resolving domination number.
APA, Harvard, Vancouver, ISO, and other styles
5

Mohamad, Jerson, and Helen Rara. "1-Movable Resolving Hop Domination in Graphs." European Journal of Pure and Applied Mathematics 16, no. 1 (2023): 418–29. http://dx.doi.org/10.29020/nybg.ejpam.v16i1.4671.

Full text
Abstract:
Let G be a connected graph. A set W ⊆ V (G) is a resolving hop dominating set of G if W is a resolving set in G and for every vertex v ∈ V (G) \ W there exists u ∈ W such that dG(u, v) = 2. A set S ⊆ V (G) is a 1-movable resolving hop dominating set of G if S is a resolving hop dominating set of G and for every v ∈ S, either S \ {v} is a resolving hop dominating set of G or there exists a vertex u ∈ ((V (G) \ S) ∩ NG(v)) such that (S \ {v}) ∪ {u} is a resolving hop dominating set of G. The 1-movable resolving hop domination number of G, denoted by γ 1 mRh(G) is the smallest cardinality of a 1-
APA, Harvard, Vancouver, ISO, and other styles
6

Sumaoy, Helyn Cosinas, and Helen Rara. "On Movable Strong Resolving Domination in Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (2022): 1201–10. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4440.

Full text
Abstract:
Let G be a connected graph. A strong resolving dominating set S is a 1-movable strong resolving dominating set of G if for every v ∈ S, either S \ {v} is a strong resolving dominating set or there exists a vertex u ∈ (V (G) \ S) ∩ NG(v) such that (S \ {v}) ∪ {u} is a strong resolving dominating set of G. The minimum cardinality of a 1-movable strong resolving dominating set of G,denoted by γ1 msR(G) is the 1-movable strong resolving domination number of G. A 1-movable strong resolving dominating set with cardinality γ1msR(G) is called a γ1msR-set of G. In this paper, we study this concept and
APA, Harvard, Vancouver, ISO, and other styles
7

Monsanto, Gerald Bacon, Penelyn L. Acal, and Helen M. Rara. "On Strong Resolving Domination in the Join and Corona of Graphs." European Journal of Pure and Applied Mathematics 13, no. 1 (2020): 170–79. http://dx.doi.org/10.29020/nybg.ejpam.v13i1.3625.

Full text
Abstract:
Let G be a connected graph. A subset S \subseteq V(G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u,v \in V(G), there exists a vertex w \in S such that u \in I_G[v,w] or v \in I_G[u,w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the join and corona of graphs and determine the bounds or exact values of the strong resolving domination number of these graphs.
APA, Harvard, Vancouver, ISO, and other styles
8

Monsanto, Gerald Bacon, Penelyn L. Acal, and Helen M. Rara. "On Strong Resolving Domination in the Join and Corona of Graphs." European Journal of Pure and Applied Mathematics 13, no. 1 (2020): 170–79. http://dx.doi.org/10.29020/nybg.ejpam.v1i1.3625.

Full text
Abstract:
Let G be a connected graph. A subset S \subseteq V(G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u,v \in V(G), there exists a vertex w \in S such that u \in I_G[v,w] or v \in I_G[u,w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the join and corona of graphs and determine the bounds or exact values of the strong resolving domination number of these graphs.
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

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
More sources

Dissertations / Theses on the topic "Resolving connected dominating set"

1

Wu, Yiwei. "Connected Dominating Set Construction and Application in Wireless Sensor Networks." Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/cs_diss/45.

Full text
Abstract:
Wireless sensor networks (WSNs) are now widely used in many applications. Connected Dominating Set (CDS) based routing which is one kind of hierarchical methods has received more attention to reduce routing overhead. The concept of k-connected m-dominating sets (kmCDS) is used to provide fault tolerance and routing flexibility. In this thesis, we first consider how to construct a CDS in WSNs. After that, centralized and distributed algorithms are proposed to construct a kmCDS. Moreover, we introduce some basic ideas of how to use CDS in other potential applications such as partial coverage and
APA, Harvard, Vancouver, ISO, and other styles
2

He, Jing S. "Connected Dominating Set Based Topology Control in Wireless Sensor Networks." Digital Archive @ GSU, 2012. http://digitalarchive.gsu.edu/cs_diss/70.

Full text
Abstract:
Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network. Moreover, Minimum-sized Connected Dominating Set (MCDS) has become a well-known approach for constructing a Virtual Backbone (VB) to alleviate the broadcasting storm for efficient routing in WSNs extensively. However, no work considers the load-balance
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Kyoung Min Sun Min-Te. "Multi initiator connected dominating set construction for mobile ad hoc networks." Auburn, Ala, 2008. http://hdl.handle.net/10415/1549.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Coelho, Rafael Santos. "The k-hop connected dominating set problem: approximation algorithms and hardness results." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/.

Full text
Abstract:
Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is connected, and for every vertex v in G, there is a vertex u in D such that the distance between v and u in G is at most k. We study the problem of finding a minimum k-hop connected dominating set of a graph (Mink-CDS). We prove that Mink-CDS is NP-hard on planar bipartite graphs of maximum degree 4. We also prove that Mink-CDS is APX-complete on bipartite graphs of maximum degree 4. We present inapproximability thresholds for Mink-CDS on bipar-
APA, Harvard, Vancouver, ISO, and other styles
5

Mahalingam, Gayathri. "Connected domination in graphs." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001225.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lin, Tao. "Mobile Ad-hoc Network Routing Protocols: Methodologies and Applications." Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/11127.

Full text
Abstract:
A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peerto- peer routing instead of static network infrastructure to provide network connectivity. MANETs have applications in rapidly deployed and dynamic military and civilian systems. The network topology in a MANET usually changes with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing protocols may not be suitable for MANETs. For example, some assumptions used by these protocols are not valid in MANETs or some protocols cannot efficiently handle topology changes. Research
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Jiakai. "AI-WSN: Adaptive and Intelligent Wireless Sensor Networks." University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1341258416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cao, Guangtong. "Distributed services for mobile ad hoc networks." Texas A&M University, 2005. http://hdl.handle.net/1969.1/2541.

Full text
Abstract:
A mobile ad hoc network consists of certain nodes that communicate only through wireless medium and can move arbitrarily. The key feature of a mobile ad hoc network is the mobility of the nodes. Because of the mobility, communication links form and disappear as nodes come into and go out of each other's communica- tion range. Mobile ad hoc networks are particularly useful in situations like disaster recovery and search, military operations, etc. Research on mobile ad hoc networks has drawn a huge amount of attention recently. The main challenges for mobile ad hoc networks are the sparse resour
APA, Harvard, Vancouver, ISO, and other styles
9

Wightman, Rojas Pedro Mario. "Topology Control in Wireless Sensor Networks." Scholar Commons, 2010. https://scholarcommons.usf.edu/etd/1807.

Full text
Abstract:
Wireless Sensor Networks (WSN) offer a flexible low-cost solution to the problem of event monitoring, especially in places with limited accessibility or that represent danger to humans. WSNs are made of resource-constrained wireless devices, which require energy efficient mechanisms, algorithms and protocols. One of these mechanisms is Topology Control (TC) composed of two mechanisms, Topology Construction and Topology Maintenance. This dissertation expands the knowledge of TC in many ways. First, it introduces a comprehensive taxonomy for topology construction and maintenance algorithms for t
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Hui. "Topology Control, Routing Protocols and Performance Evaluation for Mobile Wireless Ad Hoc Networks." Digital Archive @ GSU, 2006. http://digitalarchive.gsu.edu/cs_diss/3.

Full text
Abstract:
A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MA
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Resolving connected dominating set"

1

Du, Ding-Zhu, and Peng-Jun Wan. Connected Dominating Set: Theory and Applications. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-5242-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Du, Ding-Zhu. Connected Dominating Set: Theory and Applications. Springer New York, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Du, Ding-Zhu, and Peng-Jun Wan. Connected Dominating Set: Theory and Applications. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Connected Dominating Set Theory And Applications. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Du, Ding-Zhu, and Peng-Jun Wan. Connected Dominating Set: Theory and Applications. Springer New York, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Resolving connected dominating set"

1

Wang, Feng, Ding-Zhu Du, and Xiuzhen Cheng. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_89.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Feng, Ding-Zhu Du, and Xiuzhen Cheng. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_89-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cheng, Xiuzhen, Feng Wang, and Ding-Zhu Du. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_89.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Yu, Weizhao Wang, and Xiang-Yang Li. "Weighted Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_476.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhao, Zhang. "Strongly Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_619.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhao, Zhang. "Strongly Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_619-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Yu, Weizhao Wang, and Xiang-Yang Li. "Weighted Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_476.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kim, Donghyun, Wei Wang, Weili Wu, and Alade O. Tokuta. "Fault-Tolerant Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, Donghyun, Wei Wang, Weili Wu, and Alade O. Tokuta. "Fault-Tolerant Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_622-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Du, Hongwei, and Haiming Luo. "Routing-Cost Constrained Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_621.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Resolving connected dominating set"

1

Yılmaz, Aziz Can, and Çağatay Berke Erdaş. "Distributed Connected Dominating Set Based Algorithm for Mobile Ad-Hoc Networks." In 2024 11th International Conference on Electrical and Electronics Engineering (ICEEE). IEEE, 2024. https://doi.org/10.1109/iceee62185.2024.10779296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yu, Dongxiao, Yifei Zou, Yong Zhang, et al. "Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model." In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2019. http://dx.doi.org/10.1109/ipdps.2019.00092.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vakili, Sattar, and Qing Zhao. "Distributed node-weighted connected dominating set problems." In 2013 Asilomar Conference on Signals, Systems and Computers. IEEE, 2013. http://dx.doi.org/10.1109/acssc.2013.6810267.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Zhi, Pengfei Li, Yanxiang Bao, and Xiao Huang. "A Multi-Dominating-Subtree-based Minimum Connected Dominating Set Construction Algorithm." In 2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 2019. http://dx.doi.org/10.1109/iaeac47372.2019.8997653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yu, Jiguo, Wenchao Li, and Li Feng. "Connected Dominating Set Construction in Cognitive Radio Networks." In 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI). IEEE, 2015. http://dx.doi.org/10.1109/iiki.2015.66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Singh, Amit, and Aitha Nagaraju. "Connected dominating set based network coding for SDN." In 2016 2nd International Conference on Contemporary Computing and Informatics (IC3I). IEEE, 2016. http://dx.doi.org/10.1109/ic3i.2016.7918792.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yi, Li, Weidong Fang, Wei Chen, Wuxiong Zhang, and Guoqing Jia. "Overlapped Connected Dominating Set for Big Data Security." In IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2022. http://dx.doi.org/10.1109/infocomwkshps54753.2022.9798337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jinqin Tian and Hongsheng Ding. "Solving Minimum Connected Dominating Set on Proper Interval Graph." In 2013 6th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2013. http://dx.doi.org/10.1109/iscid.2013.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wu, Zemin, and Hai Wang. "Target Tracking Based on Connected Dominating Set in WSN." In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2008. http://dx.doi.org/10.1109/wicom.2008.910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chandra, Anita, Nachiketa Tarasia, Ashu Kumari, and Amulya Ratan Swain. "A distributed connected dominating set using adjustable sensing range." In 2014 International Conference on Advanced Communication, Control and Computing Technologies (ICACCCT). IEEE, 2014. http://dx.doi.org/10.1109/icaccct.2014.7019217.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Resolving connected dominating set"

1

Ogier, R., and P. Spagnolo. Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding. RFC Editor, 2009. http://dx.doi.org/10.17487/rfc5614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Resolving connected dominating set' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography