Log in

Relevant bibliographies by topics / Connected Product / Journal articles

Journal articles on the topic 'Connected Product'

To see the other types of publications on this topic, follow the link: Connected Product.

Author: Grafiati

Published: 7 July 2024

Last updated: 7 July 2024

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 'Connected Product.'

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

Özçelik, Ayşegül, and Markus Löchtefeld. "Connected product lifetime extension tokens (CPLET): Eliciting longevity concepts of connected audio products." Resources, Conservation and Recycling 208 (September 2024): 107734. http://dx.doi.org/10.1016/j.resconrec.2024.107734.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Moorthy, C. Ganesa, and P. Tamizharasi. "PRODUCT OF IDEAL CONNECTED SPACES." Asian-European Journal of Mathematics 04, no. 03 (September 2011): 437–43. http://dx.doi.org/10.1142/s1793557111000356.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Marcote, X., C. Balbuena, P. García-Vázquez, and J. C. Valenzuela. "Highly connected star product graphs." Electronic Notes in Discrete Mathematics 26 (September 2006): 91–96. http://dx.doi.org/10.1016/j.endm.2006.08.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pallant, Jonathan. "Cooking up A Connected Product." New Electronics 54, no. 4 (March 9, 2021): 18–19. http://dx.doi.org/10.12968/s0047-9624(22)60439-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Do, Namchul, HyunChul Kang, and Heechul Bae. "Product Development Processes and Product Data Model for Supporting Development of Smart, Connected Products." Journal of the Korean Institute of Industrial Engineers 46, no. 2 (April 30, 2020): 82–93. http://dx.doi.org/10.7232/jkiie.2020.46.2.082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Liu, Juan, and Jixiang Meng. "Super-connected and super-arc-connected Cartesian product of digraphs." Information Processing Letters 108, no. 3 (October 2008): 90–93. http://dx.doi.org/10.1016/j.ipl.2008.04.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gállego, María Pilar, Peter Hauck, Lev S. Kazarin, Ana Martínez-Pastor, and María Dolores Pérez-Ramos. "Products of Finite Connected Subgroups." Mathematics 8, no. 9 (September 4, 2020): 1498. http://dx.doi.org/10.3390/math8091498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

For a non-empty class of groups L, a finite group G=AB is said to be an L-connected product of the subgroups A and B if ⟨a,b⟩∈L for all a∈A and b∈B. In a previous paper, we prove that, for such a product, when L=S is the class of finite soluble groups, then [A,B] is soluble. This generalizes the theorem of Thompson that states the solubility of finite groups whose two-generated subgroups are soluble. In the present paper, our result is applied to extend to finite groups previous research about finite groups in the soluble universe. In particular, we characterize connected products for relevant classes of groups, among others, the class of metanilpotent groups and the class of groups with nilpotent derived subgroup. Additionally, we give local descriptions of relevant subgroups of finite groups.

8

Parmar, Nikhil. "Product Cordial Labelling of Some Connected Graphs." International Journal for Research in Applied Science and Engineering Technology V, no. IX (September 30, 2017): 1467–70. http://dx.doi.org/10.22214/ijraset.2017.9212.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Liu, Juan, Xing Chen, and Jixiang Meng. "Super restricted edge connected Cartesian product graphs." Information Processing Letters 109, no. 13 (June 2009): 655–59. http://dx.doi.org/10.1016/j.ipl.2009.02.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Leonida, Rene E., Elsie Sandueta, and Sergio R. Canoy, Jr. "Weakly connected independent and weakly connected total domination in a product of graphs." Applied Mathematical Sciences 8 (2014): 5743–49. http://dx.doi.org/10.12988/ams.2014.47587.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Kelly, S. Graham. "Free and Forced Vibrations of Elastically Connected Structures." Advances in Acoustics and Vibration 2010 (January 2, 2010): 1–11. http://dx.doi.org/10.1155/2010/984361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

A general theory for the free and forced responses of elastically connected parallel structures is developed. It is shown that if the stiffness operator for an individual structure is self-adjoint with respect to an inner product defined for , then the stiffness operator for the set of elastically connected structures is self-adjoint with respect to an inner product defined on . This leads to the definition of energy inner products defined on . When a normal mode solution is used to develop the free response, it is shown that the natural frequencies are the square roots of the eigenvalues of an operator that is self-adjoint with respect to the energy inner product. The completeness of the eigenvectors in is used to develop a forced response. Special cases are considered. When the individual stiffness operators are proportional, the problem for the natural frequencies and mode shapes reduces to a matrix eigenvalue problem, and it is shown that for each spatial mode there is a set of intramodal mode shapes. When the structures are identical, uniform, or nonuniform, the differential equations are uncoupled through diagonalization of a coupling stiffness matrix. The most general case requires an iterative solution.

12

Jakubík, Ján, and Mária Csontóová. "Cancellation rule for internal direct product decompositions of a connected partially ordered set." Mathematica Bohemica 125, no. 1 (2000): 115–22. http://dx.doi.org/10.21136/mb.2000.126261.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Aguiar, Marcelo, and Swapneel Mahajan. "On the Hadamard Product of Hopf Monoids." Canadian Journal of Mathematics 66, no. 3 (June 1, 2014): 481–504. http://dx.doi.org/10.4153/cjm-2013-005-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

AbstractCombinatorial structures that compose and decompose give rise to Hopf monoids in Joyal's category of species. The Hadamard product of two Hopf monoids is another Hopf monoid. We prove two main results regarding freeness of Hadamard products. The first one states that if one factor is connected and the other is free as a monoid, their Hadamard product is free (and connected). The second provides an explicit basis for the Hadamard product when both factors are free.The first main result is obtained by showing the existence of a one-parameter deformation of the comonoid structure and appealing to a rigidity result of Loday and Ronco that applies when the parameter is set to zero. To obtain the second result, we introduce an operation on species that is intertwined by the free monoid functor with theHadamard product. As an application of the first result, we deduce that the Boolean transform of the dimension sequence of a connected Hopf monoid is nonnegative.

14

Yin, Jiaqiong, and Yingzhi Tian. "Super Connected Direct Product of Graphs and Cycles." Axioms 11, no. 6 (June 9, 2022): 277. http://dx.doi.org/10.3390/axioms11060277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

The topology of an interconnection network can be modeled by a graph G=(V(G),E(G)). The connectivity of graph G is a parameter used to measure the reliability of a corresponding network. The direct product is an important graph product. This paper mainly focuses on the super connectedness of the direct product of graphs and cycles. The connectivity of G, denoted by κ(G), is the size of a minimum vertex set S⊆V(G) such that G−S is not connected or has only one vertex. The graph G is said to be super connected, simply super-κ, if every minimum vertex cut is the neighborhood of a vertex with minimum degree. The direct product of two graphs G and H, denoted by G×H, is the graph with vertex set V(G×H)=V(G)×V(H) and edge set E(G×H)={(u1,v1)(u2,v2)|u1u2∈E(G),v1v2∈E(H)}. In this paper, we give some sufficient conditions for the direct product G×Cn to be super connected, where Cn is the cycle on n vertices. Furthermore, those sufficient conditions are the best possible.

15

Olson, David L., Desheng Wu, Yang Shanlin, and James H. Lambert. "Complex product manufacturing in the intelligence-connected era." International Journal of Production Research 57, no. 21 (October 16, 2019): 6702–4. http://dx.doi.org/10.1080/00207543.2019.1645442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Milgram, R. J., and Andrew Ranicki. "Some product formulae for nonsimply connected surgery problems." Transactions of the American Mathematical Society 297, no. 2 (February 1, 1986): 383. http://dx.doi.org/10.1090/s0002-9947-1986-0854074-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Ivančo, Jaroslav. "On 3-total edge product cordial connected graphs." Opuscula Mathematica 37, no. 45 (2017): 725. http://dx.doi.org/10.7494/opmath.2017.37.5.725.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Wiener, Hillary J. D., Joshua Wiener, and Todd Arnold. "Enhancing perceived product value through peripheral product anecdotes." European Journal of Marketing 56, no. 2 (December 16, 2021): 375–99. http://dx.doi.org/10.1108/ejm-07-2020-0538.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Purpose The purpose of this paper is to introduce a new strategic marketing tool: a peripheral product anecdote (PPA), or a brief, interesting story that is loosely connected to a product but not connected to its history, quality or usage. A PPA is contrasted with similar tools, such as product/brand heritage claims. This study investigates when PPAs are most effective at increasing willingness to pay. Design/methodology/approach Five experiments examine the effect of different PPAs on willingness to pay. This study examines product-use situation as a moderator (Studies 3 and 4) and conversational value as a mediator (Studies 2 and 4). Findings Customers will pay a premium for products with PPAs, but only when they intend to use the products in social situations where they could share the anecdote with others. Mediation analyses reveal these anecdotes are valuable because they provide purchasers with a conversation topic (a source of social currency). Practical implications In contrast to brand heritage stories, nearly any firm can associate a PPA with their product. These anecdotes are a low-cost way for firms to increase willingness to pay for products. PPAs are innovative and varied, unlike brand heritage stories which tend to be static. Originality/value This paper shows that customers sometimes want packaged goods, such as beer and snacks, to help them have conversations and will pay more for products that do so. It introduces the PPA as one way marketers can help customers achieve this goal of conversation.

19

Bujtás, Csilla, Pakanun Dokyeesun, Vesna Iršič, and Sandi Klavžar. "Connected domination game played on Cartesian products." Open Mathematics 17, no. 1 (November 8, 2019): 1269–80. http://dx.doi.org/10.1515/math-2019-0111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Abstract The connected domination game on a graph G is played by Dominator and Staller according to the rules of the standard domination game with the additional requirement that at each stage of the game the selected vertices induce a connected subgraph of G. If Dominator starts the game and both players play optimally, then the number of vertices selected during the game is the connected game domination number of G. Here this invariant is studied on Cartesian product graphs. A general upper bound is proved and demonstrated to be sharp on Cartesian products of stars with paths or cycles. The connected game domination number is determined for Cartesian products of P3 with arbitrary paths or cycles, as well as for Cartesian products of an arbitrary graph with Kk for the cases when k is relatively large. A monotonicity theorem is proved for products with one complete factor. A sharp general lower bound on the connected game domination number of Cartesian products is also established.

20

DeLillo, T. K., T. A. Driscoll, A. R. Elcrat, and J. A. Pfaltzgraff. "Radial and circular slit maps of unbounded multiply connected circle domains." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464, no. 2095 (March 18, 2008): 1719–37. http://dx.doi.org/10.1098/rspa.2008.0006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Infinite product formulae for conformally mapping an unbounded multiply connected circle domain to an unbounded canonical radial or circular slit domain, or to domains with both radial and circular slit boundary components are derived and implemented numerically and graphically. The formulae are generated by analytic continuation with the reflection principle. Convergence of the infinite products is proved for domains with sufficiently well-separated boundary components. Some recent progress in the numerical implementation of infinite product mapping formulae is presented.

21

Latchoumanane, Vinothkumar, and Murugan Varadhan. "Antimagic Labeling for Product of Regular Graphs." Symmetry 14, no. 6 (June 14, 2022): 1235. http://dx.doi.org/10.3390/sym14061235.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and such that any two vertices of G have distinct vertex sums where the vertex sum of a vertex v in V(G) is nothing but the sum of all the incident edge labeling of G. In this paper, we discussed the antimagicness of rooted product and corona product of graphs. We proved that if we let G be a connected t-regular graph and H be a connected k-regular graph, then the rooted product of graph G and H admits antimagic labeling if t≥k. Moreover, we proved that if we let G be a connected t-regular graph and H be a connected k-regular graph, then the corona product of graph G and H admits antimagic labeling for all t,k≥2.

22

Bujtás, Csilla, Michael A. Henning, Vesna Iršič, and Sandi Klavžar. "Total connected domination game." Opuscula Mathematica 41, no. 4 (2021): 453–64. http://dx.doi.org/10.7494/opmath.2021.41.4.453.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

The (total) connected domination game on a graph \(G\) is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirement that at each stage of the game the selected vertices induce a connected subgraph of \(G\). If Dominator starts the game and both players play optimally, then the number of vertices selected during the game is the (total) connected game domination number (\(\gamma_{\rm tcg}(G)\)) \(\gamma_{\rm cg}(G)\) of \(G\). We show that \(\gamma_{\rm tcg}(G) \in \{\gamma_{\rm cg}(G),\gamma_{\rm cg}(G) + 1,\gamma_{\rm cg}(G) + 2\}\), and consequently define \(G\) as Class \(i\) if \(\gamma_{\rm tcg}(G) = \gamma_{\rm cg} + i\) for \(i \in \{0,1,2\}\). A large family of Class \(0\) graphs is constructed which contains all connected Cartesian product graphs and connected direct product graphs with minumum degree at least \(2\). We show that no tree is Class \(2\) and characterize Class \(1\) trees. We provide an infinite family of Class \(2\) bipartite graphs.

23

Algie, David. "A connected legal world – Lexis+ UK." Legal Information Management 23, no. 2 (June 2023): 105–9. http://dx.doi.org/10.1017/s1472669623000269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

AbstractThe LexisLibrary and LexisPSL legal content platforms are well known to legal information professionals and lawyers in the UK. The release of the Lexis+ UK service seamlessly brings together these resources on one platform for the first time, allowing the researcher to search and retrieve relevant and connected content through one search interface. David Algie, the Lexis+ Product Marketing Manager at LexisNexis, talks LIM readers through this innovative and ‘feature rich’ new product.

24

Ivančo, Jaroslav. "On edge product cordial graphs." Opuscula Mathematica 39, no. 5 (2019): 691–703. http://dx.doi.org/10.7494/opmath.2019.39.5.691.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling. Using this characterization we investigate the edge product cordiality of broad classes of graphs, namely, dense graphs, dense bipartite graphs, connected regular graphs, unions of some graphs, direct products of some bipartite graphs, joins of some graphs, maximal \(k\)-degenerate and related graphs, product cordial graphs.

25

Gupta, Punam. "On compact Einstein doubly warped product manifolds." Tamkang Journal of Mathematics 49, no. 4 (December 25, 2018): 267–75. http://dx.doi.org/10.5556/j.tkjm.49.2018.2605.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

In this paper, the non-existence of connected, compact Einstein doubly warped product semi-Riemannian manifold with non-positive scalar curvature is proved. It is also shown that there does not exist non-trivial connected Einstein doubly warped product semi-Riemannian manifold with compact base $B$ or fibre $F$.

26

Ye, Hazhe, and Yingzhi Tian. "The Restricted Edge-Connectivity of Strong Product Graphs." Axioms 13, no. 4 (March 31, 2024): 231. http://dx.doi.org/10.3390/axioms13040231.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

The restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each component has at least two vertices. It was proved that λ′(G) exists if and only if G has at least four vertices and G is not a star. In this case, a graph G is called maximally restricted edge-connected if λ′(G)=ξ(G), and a graph G is called super restricted edge-connected if each minimum restricted edge-cut isolates an edge of G. The strong product of graphs G and H, denoted by G⊠H, is the graph with the vertex set V(G)×V(H) and the edge set {(x1,y1)(x2,y2)|x1=x2 and y1y2∈E(H); or y1=y2 and x1x2∈E(G); or x1x2∈E(G) and y1y2∈E(H)}. In this paper, we determine, for any nontrivial connected graph G, the restricted edge-connectivity of G⊠Pn, G⊠Cn and G⊠Kn, where Pn, Cn and Kn are the path, cycle and complete graph of order n, respectively. As corollaries, we give sufficient conditions for these strong product graphs G⊠Pn, G⊠Cn and G⊠Kn to be maximally restricted edge-connected and super restricted edge-connected.

27

Borowiecki, Mieczysław, Anna Fiedorowicz, and Elżbieta Sidorowicz. "Connected domination game." Applicable Analysis and Discrete Mathematics 13, no. 1 (2019): 261–89. http://dx.doi.org/10.2298/aadm171126020b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

In this paper we introduce a domination game based on the notion of connected domination. Let G = (V,E) be a connected graph of order at least 2. We define a connected domination game on G as follows: The game is played by two players, Dominator and Staller. The players alternate taking turns choosing a vertex of G (Dominator starts). A move of a player by choosing a vertex v is legal, if (1) the vertex v dominates at least one additional vertex that was not dominated by the set of previously chosen vertices and (2) the set of all chosen vertices induces a connected subgraph of G. The game ends when none of the players has a legal move (i.e., G is dominated). The aim of Dominator is to finish as soon as possible, Staller has an opposite aim. Let D be the set of played vertices obtained at the end of the connected domination game (D is a connected dominating set of G). The connected game domination number of G, denoted cg(G), is the minimum cardinality of D, when both players played optimally on G. We provide an upper bound on cg(G) in terms of the connected domination number. We also give a tight upper bound on this parameter for the class of 2-trees. Next, we investigate the Cartesian product of a complete graph and a tree, and we give exact values of the connected game domination number for such a product, when the tree is a path or a star. We also consider some variants of the game, in particular, a Staller-start game.

28

Arriola, Benjier H., and Sergio R. Canoy. "Doubly connected domination in the join and Cartesian product of some graphs." Asian-European Journal of Mathematics 07, no. 04 (December 2014): 1450054. http://dx.doi.org/10.1142/s1793557114500545.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Let G be a simple connected graph. A connected dominating set S ⊂ V(G) is called a doubly connected dominating set of G if the subgraph 〈V(G)\S〉 induced by V(G)\S is connected. We show that given any three positive integers a, b, and c with 4 ≤ a ≤ b ≤ c, where b ≤ 2a, there exists a connected graph G such that a = γr(G), b = γtr(G), and c = γcc(G), where γr, γtr, and γcc are, respectively, the restrained domination, total restrained domination, and doubly connected domination parameters. Also, we characterize the doubly connected dominating sets in the join of any graphs and Cartesian product of some graphs. The corresponding doubly connected domination numbers of these graphs are also determined.

29

Enriquez, Enrico L., and Albert D. Ngujo. "Clique doubly connected domination in the join and lexicographic product of graphs." Discrete Mathematics, Algorithms and Applications 12, no. 05 (July 22, 2020): 2050066. http://dx.doi.org/10.1142/s1793830920500664.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Let [Formula: see text] be a connected simple graph. A set [Formula: see text] is a doubly connected dominating set if it is dominating and both [Formula: see text] and [Formula: see text] are connected. A nonempty subset [Formula: see text] of the vertex set [Formula: see text] is a clique in [Formula: see text] if the graph [Formula: see text] induced by [Formula: see text] is complete. A clique dominating set [Formula: see text] of [Formula: see text] is a clique doubly connected dominating set if [Formula: see text] is a doubly connected dominating set of [Formula: see text]. The clique doubly connected domination number of [Formula: see text], denoted by [Formula: see text], is the smallest cardinality of a clique doubly connected dominating set [Formula: see text] of [Formula: see text]. In this paper, we give the characterization of the clique doubly connected dominating set and the clique doubly connected domination number in the join (and lexicographic product) of two graphs.

30

Kojima, Toru, and Kiyoshi Ando. "Bandwidth of the cartesian product of two connected graphs." Discrete Mathematics 252, no. 1-3 (May 2002): 227–35. http://dx.doi.org/10.1016/s0012-365x(01)00455-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Illanes, Alejandro. "Small connected neighborhoods containing the diagonal of a product." Topology and its Applications 230 (October 2017): 506–16. http://dx.doi.org/10.1016/j.topol.2017.08.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Kim, Sunho, Ricardo Perez Del Castillo, Ismael Caballero, Jimwoo Lee, Changsoo Lee, Downgwoo Lee, Sangyub Lee, and Alejandro Mate. "Extending Data Quality Management for Smart Connected Product Operations." IEEE Access 7 (2019): 144663–78. http://dx.doi.org/10.1109/access.2019.2945124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Kojima, Toru. "Bandwidth of the strong product of two connected graphs." Discrete Mathematics 308, no. 7 (April 2008): 1282–95. http://dx.doi.org/10.1016/j.disc.2007.03.074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Holdford, David A. "Perspectives on the pharmacist’s “product”: a narrative review." Pharmacy Practice 19, no. 2 (May 31, 2021): 2430. http://dx.doi.org/10.18549/pharmpract.2021.2.2430.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Clarity about the pharmacist’s “product” is fundamental to developing and communicating the value of pharmacy offerings. It is clear within the profession that pharmacists use their scope of knowledge and technical skills to address medication-related needs of individuals and populations. However, confusion still remains in the professional and public literature about what a pharmacist precisely produces for society. Is it a drug, service, program, solution, or something else? As the profession evolves from one that focuses on dispensing drugs to a profession that seeks to achieve positive patient health outcomes, pharmacists need to better conceptualize and articulate what they produce. This narrative review explores ideas from the marketing, business strategy, and entrepreneurship literature to discuss diverse perspectives on the pharmacist’s product. The four perspectives are the product as (1) a tangible product, (2) an intangible service, (3) a “smart, connected” good or service, and (4) a solution to a customer problem in whatever form provided. Based upon these perspectives, the pharmacist’s product can be any combination of tangible or intangible, face-to-face or virtual offering produced by pharmacists that seeks to satisfy medication-related needs and wants of pharmacy patients and customers. Ideas discussed in this review include the total product concept, classification schemes from the services marketing literature, the theory of service-dominant logic, the concepts of “smart, connected” products and industrialized intimacy, and the jobs-to-be-done framework. These various perspectives offer lessons for pharmacists on how to innovate when serving patients and customers and to communicate the pharmacist’s value proposition to the people they serve.

35

Klavžar, Sandi, and Ismael G. Yero. "The general position problem and strong resolving graphs." Open Mathematics 17, no. 1 (October 13, 2019): 1126–35. http://dx.doi.org/10.1515/math-2019-0088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Abstract The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic. It is proved that gp(G) ≥ ω(GSR), where GSR is the strong resolving graph of G, and ω(GSR) is its clique number. That the bound is sharp is demonstrated with numerous constructions including for instance direct products of complete graphs and different families of strong products, of generalized lexicographic products, and of rooted product graphs. For the strong product it is proved that gp(G ⊠ H) ≥ gp(G)gp(H), and asked whether the equality holds for arbitrary connected graphs G and H. It is proved that the answer is in particular positive for strong products with a complete factor, for strong products of complete bipartite graphs, and for certain strong cylinders.

36

Raffaeli, Roberto, Maura Mengoni, and Michele Germani. "Improving the link between computer-assisted design and configuration tools for the design of mechanical products." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 27, no. 1 (January 15, 2013): 51–64. http://dx.doi.org/10.1017/s0890060412000388.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

AbstractThe competitive market forces companies to offer tailored products to meet specific customer needs. To avoid wasting time, design efforts generally address the configuration of existing solutions, without producing substantial design modifications. Configuration tools are used to achieve customized products starting from a common platform. Many approaches have been successfully proposed in literature to configure products. However, in the mechanical field they need further investigation in order to be efficiently linked to computer-aided design technologies. Research is focused on tools and methods to automatically produce geometrical models and improve the flexibility of the continuous product updating process. In this context, this paper aims to combine product configuration approaches with design automation techniques in order to support design activities of products to fulfill specific requirements. The approach is based on entities called configurable virtual prototypes. Three different domains are managed and connected via configurable virtual prototypes: product specifications, geometrical data, and product knowledge. In particular, geometry recognition rules are used to identify the parameterization of parts and the assembly mating constraints. The approach is exemplified through an industrial case study where a tool has been developed on the basis of the described method. Advantages of the system are shown in terms of achieved product configuration efficiency.

37

Ewert, Janina. "Semilocal connectedness of product spaces ands-continuity of maps." International Journal of Mathematics and Mathematical Sciences 24, no. 4 (2000): 257–64. http://dx.doi.org/10.1155/s0161171200002337.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

We consider the problem of the transfer of semilocal connectedness from factors to the product space and vice versa. Some sufficient conditions are given under which the product of semilocally connected spaces is semilocally connected. Obtained theorems are not invertible, suitable examples are given.

38

Meier, John. "The topology of graph products of groups." Proceedings of the Edinburgh Mathematical Society 37, no. 3 (October 1994): 539–44. http://dx.doi.org/10.1017/s001309150001899x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

Given a finite (connected) simplicial graph with groups assigned to the vertices, the graph product of the vertex groups is the free product modulo the relation that adjacent groups commute. The graph product of finitely presented infinite groups is both semistable at infinity and quasi-simply filtrated. Explicit bounds for the isoperimetric inequality and isodiametric inequality for graph products is given, based on isoperimetric and isodiametric inequalities for the vertex groups.

39

Manta, Christine, Nikhil Mahadevan, Jessie Bakker, Simal Ozen Irmak, Elena Izmailova, Siyeon Park, Jiat-Ling Poon, et al. "EVIDENCE Publication Checklist for Studies Evaluating Connected Sensor Technologies: Explanation and Elaboration." Digital Biomarkers 5, no. 2 (May 18, 2021): 127–47. http://dx.doi.org/10.1159/000515835.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

The EVIDENCE (EValuatIng connecteD sENsor teChnologiEs) checklist was developed by a multidisciplinary group of content experts convened by the Digital Medicine Society, representing the clinical sciences, data management, technology development, and biostatistics. The aim of EVIDENCE is to promote high quality reporting in studies where the primary objective is an evaluation of a digital measurement product or its constituent parts. Here we use the terms digital measurement product and connected sensor technology interchangeably to refer to tools that process data captured by mobile sensors using algorithms to generate measures of behavioral and/or physiological function. EVIDENCE is applicable to 5 types of evaluations: (1) proof of concept; (2) verification, (3) analytical validation, and (4) clinical validation as defined by the V3 framework; and (5) utility and usability assessments. Using EVIDENCE, those preparing, reading, or reviewing studies evaluating digital measurement products will be better equipped to distinguish necessary reporting requirements to drive high-quality research. With broad adoption, the EVIDENCE checklist will serve as a much-needed guide to raise the bar for quality reporting in published literature evaluating digital measurements products.

40

Entero, Giovannie M., and Ariel C. Pedrano. "ON CONNECTED TOTAL DOMINATION POLYNOMIAL OF SOME LEXICOGRAPHIC PRODUCT GRAPHS." Advances and Applications in Discrete Mathematics 27, no. 1 (May 20, 2021): 147–55. http://dx.doi.org/10.17654/dm027010147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Dai, Yong, Yi Li, Bin Sun, and Li-Jun Liu. "Skip-connected network with gram matrix for product image retrieval." Neurocomputing 447 (August 2021): 307–18. http://dx.doi.org/10.1016/j.neucom.2021.03.067.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Militante, Mae P., and Rolito G. Eballe. "Weakly connected 2-domination in the lexicographic product of graphs." International Journal of Mathematical Analysis 16, no. 3 (2022): 125–32. http://dx.doi.org/10.12988/ijma.2022.912428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

BUTANAS, LYLE LEON L., and MHELMAR A. LABENDIA. "θω-CONNECTED SPACE AND θω-CONTINUITY IN THE PRODUCT SPACE." Poincare Journal of Analysis and Applications 07, no. 01 (June 25, 2020): 79–88. http://dx.doi.org/10.46753/pjaa.2020.v07i01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Niu, Huijuan, Yongqing Huang, Yisu Yang, Kai Liu, Xiaofeng Duan, Gang Wu, Tao Liu, Qi Wei, and Xiaomin Ren. "High Bandwidth-Efficiency Product MPIN Photodiode With Parallel-Connected Microstructure." IEEE Journal of Quantum Electronics 56, no. 5 (October 2020): 1–5. http://dx.doi.org/10.1109/jqe.2020.3004130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Herrera-Carrasco, David, María de J. López, and Fernando Macías-Romero. "Almost meshed locally connected continua have unique second symmetric product." Topology and its Applications 209 (August 2016): 1–13. http://dx.doi.org/10.1016/j.topol.2016.05.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Córdova-Salazar, Vianey, David Herrera-Carrasco, and Fernando Macías-Romero. "Almost meshed locally connected continua have unique third symmetric product." Topology and its Applications 268 (December 2019): 106917. http://dx.doi.org/10.1016/j.topol.2019.106917.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Sandueta, Elsie, and Sergio R. Canoy, Jr. "Weakly connected dominating sets in the lexicographic product of graphs." International Journal of Mathematical Analysis 8 (2014): 1973–80. http://dx.doi.org/10.12988/ijma.2014.47224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

von Geibler, Justus, Klaus Wiesen, Robert Stewart Mostyn, Markus Werner, Nuria Riera, Dai Zhong Su, Sten Erik Björling, et al. "Forming the Nucleus of a Novel Ecological Accounting System: The myEcoCost Approach." Key Engineering Materials 572 (September 2013): 78–83. http://dx.doi.org/10.4028/www.scientific.net/kem.572.78.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

The limited data availability, transparency and harmonisation in environmental assessments of products are bottlenecks for improved environmental and sustainability governance. Despite the progressive developments of information and communication systems, reliable, accurate, up-to-date data for assessing the resource use of products and services is still lacking. Resource accounting systems often have limited scope on single companies, processes or products. This paper presents an approach for an automated bottom-up accounting system for measuring resource efficiency at product and service level. It is based on a global collaborative network of resource accounting nodes connected for the accounting of natural resources use for products and services. Using an Internet-based service-oriented architecture, relevant and timely data is passed from supplier to customer recursively through the whole value chain to produce an “ecoCost” for each product or service. This conceptual paper reflects first experiences from partners of the myEcoCost project funded by European Commission (www.myecocost.com).

49

Cabulao, Jessa Mae Carpentero, and Rowena T. Isla. "On Connected Partial Domination in Graphs." European Journal of Pure and Applied Mathematics 14, no. 4 (November 10, 2021): 1490–506. http://dx.doi.org/10.29020/nybg.ejpam.v14i4.4168.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

This paper introduces and investigates a variant of partial domination called the connected Î±-partial domination. For any graph G = (V (G), E(G)) and Î± âˆˆ (0, 1], a set S âŠ† V (G) is an Î±-partial dominating set in G if |N[S]| â‰¥ Î± |V (G)|. An Î±-partial dominating set S âŠ† V (G) is a connected Î±-partial dominating set in G if âŸ¨SâŸ©, the subgraph induced by S, is connected. The connected Î±-partial domination number of G, denoted by âˆ‚CÎ±(G), is the smallest cardinality of a connected Î±-partial dominating set in G. In this paper, we characterize the connected Î±-partial dominating sets in the join and lexicographic product of graphs for any Î± âˆˆ (0, 1] and determine the corresponding connected Î±-partial domination numbers of graphs resulting from the said binary operations. Moreover, we establish sharp bounds for the connected Î±-partial domination numbers of the corona and Cartesian product of graphs. Furthermore, we determine âˆ‚CÎ±(G) of some special graphs when Î± =1/2. Several realization problems are also generated in this paper.

50

Fabšíková, Tereza. "Právní regulace související s výrobky v kontextu cílů Evropské unie v oblasti ochrany klimatu." AUC IURIDICA 70, no. 1 (March 25, 2024): 63–75. http://dx.doi.org/10.14712/23366478.2024.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Abstract:

This paper examines how objectives of the European Union in the field of climate change affect the legal regulation of products and what impacts they also have on some connected issues. The current ecodesign legal regulation is based on the Ecodesign Directive and the particular requirements on products are then set in regulations following the Ecodesign Directive. The paper primarily focuses on the changes in ecodesign product regulation brought by the new Ecodesign for Sustainable Products Regulation proposal. The issue of the proposed legal regulation connected with environmental claims is also addressed in the text as it is an important complement to the sustainable products legal regulation.