Log in

Relevant bibliographies by topics / Vertex switching / Journal articles

To see the other types of publications on this topic, follow the link: Vertex switching.

Journal articles on the topic 'Vertex switching'

Author: Grafiati

Published: 3 June 2025

Last updated: 22 June 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 'Vertex switching.'

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

C. Jayasekaran, A. Vinoth Kumar, and M. Ashwin Shijo. "2-Vertex self switching of umbrella graph." Malaya Journal of Matematik 8, no. 04 (2020): 2359–68. http://dx.doi.org/10.26637/mjm0804/0183.

Full text

Abstract:

By a graph \(G=(V, E)\) we mean a finite undirected graph without loops or multiple edges. Let \(G\) be a graph and \(\sigma \subseteq V\) be a non-empty subset of \(V\). Then \(\sigma\) is said to be a self switching of \(G\) if and only if \(G \cong G^\sigma\). It can also be referred to as \(|\sigma|\)-vertex self-switching. The set of all self switching of the graph \(G\) with cardinality \(k\) is represented by \(S_k(G)\) and its cardinality by \(s s_k(G)\). A vertex \(v\) of a graph \(G\) is said to be self vertex switching if \(G \cong G^v\). The set of all self vertex switchings of \(G\) is denoted by \(\operatorname{SS}_1(G)\) and its cardinality is given by \(s s_1(G)\). If \(|\sigma|=2\), we call it as a 2-vertex self switching. The set of all 2-vertex switchings of \(G\) is denoted by \(\operatorname{SS}_2(G)\) and its cardinality is given by \(s s_2(G)\). In this paper we find the number of 2-vertex self switching vertices for the umbrella graph \(U_{m, n}\).

APA, Harvard, Vancouver, ISO, and other styles

2

Stanley, Richard P. "Reconstruction from vertex-switching." Journal of Combinatorial Theory, Series B 38, no. 2 (1985): 132–38. http://dx.doi.org/10.1016/0095-8956(85)90078-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ellingham, M. N. "Vertex-switching, isomorphism, and pseudosimilarity." Journal of Graph Theory 15, no. 6 (1991): 563–72. http://dx.doi.org/10.1002/jgt.3190150602.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Krasikov, I., and Y. Roditty. "More on Vertex-Switching Reconstruction." Journal of Combinatorial Theory, Series B 60, no. 1 (1994): 40–55. http://dx.doi.org/10.1006/jctb.1994.1004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

G. Sumathy and K.S. Shruthi. "Some results on strong 2 - vertex duplication self switching of some connected graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2306–8. http://dx.doi.org/10.26637/mjm0804/0171.

Full text

Abstract:

A vertex \(v \in V(G)\) is said to be a self vertex switching of \(G\) if \(G\) is isomorphic to \(G^v\), where \(G^v\) is the graph obtained from \(G\) by deleting all edges of \(G\) incident to \(v\) in \(G\) and adding all edges incident to \(v\) which are not in \(G\). A vertex \(v^{\prime}\) is the duplication of \(v\) if all the vertices which are adjacent to \(v\) in \(G\) are also adjacent to \(v^{\prime}\) in \(D(v G)\), which is the duplication graph of \(G\). Duplication self vertex switching of various graphs are given in the literature. In this paper we discuss about the 2-vertex duplication self switching graphs.

APA, Harvard, Vancouver, ISO, and other styles

6

Sheriff, M. Mohamed, and G. Vijayalakshmi. "Face Sum Divisor Cordial Graphs." International Journal of Fuzzy Mathematical Archive 15, no. 02 (2018): 197–204. http://dx.doi.org/10.22457/ijfma.v15n2a10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Krasikov, I. "Degree conditions for vertex switching reconstruction." Discrete Mathematics 160, no. 1-3 (1996): 273–78. http://dx.doi.org/10.1016/0012-365x(95)00167-u.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ellingham, M. N. "Vertex-Switching Reconstruction and Folded Cubes." Journal of Combinatorial Theory, Series B 66, no. 2 (1996): 361–64. http://dx.doi.org/10.1006/jctb.1996.0027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Jayasekaran, C., J. Christabel Sudha, and M. Ashwin Shijo. "2-Vertex Self Switching of Trees." Communications in Mathematics and Applications 13, no. 3 (2022): 1037–46. http://dx.doi.org/10.26713/cma.v13i3.1369.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

V., Ganesan, and K. Balamurugan Dr. "ON PRIME LABELING OF CUBIC GRAPH WITH 8 VERTICES." International Journal of Multidisciplinary Research and Modern Education (IJMRME) 2, no. 2 (2016): 49–54. https://doi.org/10.5281/zenodo.61806.

Full text

Abstract:

<em>In this paper, we show that the cubic graph on 8 vertices admits prime labeling, we also proved that the graphs obtained by merging (or) fusion of two vertices, duplication of an arbitrary vertex and switching of an arbitrary vertex in the cubic graph are prime graphs.</em>

APA, Harvard, Vancouver, ISO, and other styles

11

U. M. Prajapat and P. A. Patel. "Sum divisor cordial labeling in the context of graph operations on grötzsch." Journal of Computational Mathematica 6, no. 1 (2022): 078–90. http://dx.doi.org/10.26524/cm122.

Full text

Abstract:

A Sum divisor cordial labeling of a graph G with vertex set V is a bijection r from V to {1,2,3,...,|V (G )|} such that an edge uv is assigned the label 1 if 2 divides r(u)+ r (v ) and 0 otherwise; and the number of edges labeled with 0 and the number of edges labeled with 1differ by at most 1 . A graph with a sum divisor cordial labeling is called sum divisor cordial graph. In this research paper, we investigate the sum divisor cordial labeling bahevior for Grötzsch graph, fusion of any two vertices in Grötzsch graph, duplication of an arbitrary vertex in Grötzsch graph, duplication of an arbitrary vertex by an edge in Grötzsch graph, switching of an arbitrary vertex of degree four in Grötzsch graph, switching of an arbitrary vertex of degree three in Grötzsch graph and path union of two copies of Grötzsch.

APA, Harvard, Vancouver, ISO, and other styles

12

Krasikov, I. "A note on the vertex-switching reconstruction." International Journal of Mathematics and Mathematical Sciences 11, no. 4 (1988): 825–27. http://dx.doi.org/10.1155/s0161171288001012.

Full text

Abstract:

Bounds on the maximum and minimum degree of a graph establishing its reconstructibility from the vertex switching are given. It is also shown that any disconnected graph with at least five vertices is reconstructible.

APA, Harvard, Vancouver, ISO, and other styles

13

Özden Ayna, Hacer. "A Study on Zagreb Indices of Vertex-Switching for Special Graph Classes." Journal of New Theory, no. 48 (September 30, 2024): 48–60. http://dx.doi.org/10.53570/jnt.1522803.

Full text

Abstract:

Many graph theorists have studied graph operations due to their applications and the advantages with heavy calculations. In a recent paper, the vertex-switching operation is analyzed, and some vertex-switched graphs are determined for some graph classes. This paper calculates the first Zagreb index and the second Zagreb index of vertex-switched star, complete bipartite, and tadpole graphs. It finally discusses the need for further research.

APA, Harvard, Vancouver, ISO, and other styles

14

S. K. Vaidya and N. J. Kothari. "Line gracefulness in the context of switching of a vertex." Malaya Journal of Matematik 3, no. 03 (2015): 233–40. http://dx.doi.org/10.26637/mjm303/002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Jayasekaran, C., J. Christabel Sudha, and M. Ashwin Shijo. "Some Results on 2-Vertex Switching in Joints." Communications in Mathematics and Applications 12, no. 1 (2021): 59–69. http://dx.doi.org/10.26713/cma.v12i1.1426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Jayasekaran, C., and M. Ashwin Shijo. "Anti-duplication self vertex switching in some graphs." Malaya Journal of Matematik 9, no. 1 (2021): 338–42. http://dx.doi.org/10.26637/mjm0901/0057.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Jayasekaran, C., and G. Sumathy. "Self Vertex Switching of Connected Two-Cyclic Graphs." Journal of Discrete Mathematical Sciences and Cryptography 17, no. 2 (2014): 157–79. http://dx.doi.org/10.1080/09720529.2014.881132.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Krasikov, I. "Applications of balance equations to vertex switching reconstruction." Journal of Graph Theory 18, no. 3 (1994): 217–25. http://dx.doi.org/10.1002/jgt.3190180302.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Paßens, M., and S. Karthäuser. "Rotational switches in the two-dimensional fullerene quasicrystal." Acta Crystallographica Section A Foundations and Advances 75, no. 1 (2019): 41–49. http://dx.doi.org/10.1107/s2053273318015681.

Full text

Abstract:

One of the essential components of molecular electronic circuits are switching elements that are stable in two different states and can ideally be switched on and off many times. Here, distinct buckminsterfullerenes within a self-assembled monolayer, forming a two-dimensional dodecagonal quasicrystal on a Pt-terminated Pt3Ti(111) surface, are identified to form well separated molecular rotational switching elements. Employing scanning tunneling microscopy, the molecular-orbital appearance of the fullerenes in the quasicrystalline monolayer is resolved. Thus, fullerenes adsorbed on the 36 vertex configuration are identified to exhibit a distinctly increased mobility. In addition, this finding is verified by differential conductance measurements. The rotation of these mobile fullerenes can be triggered frequently by applied voltage pulses, while keeping the neighboring molecules immobile. An extensive analysis reveals that crystallographic and energetic constraints at the molecule/metal interface induce an inequality of the local potentials for the 36 and 32.4.3.4 vertex sites and this accounts for the switching ability of fullerenes on the 36 vertex sites. Consequently, a local area of the 8/3 approximant in the two-dimensional fullerene quasicrystal consists of single rotational switching fullerenes embedded in a matrix of inert molecules. Furthermore, it is deduced that optimization of the intermolecular interactions between neighboring fullerenes hinders the realization of translational periodicity in the fullerene monolayer on the Pt-terminated Pt3Ti(111) surface.

APA, Harvard, Vancouver, ISO, and other styles

20

Sevinj Jebrayilova, Sevinj Jebrayilova. "METHODOLOGY FOR PLANNING THE LOCATION OF SWITCHING NODES OF IP-TELEPHONY NETWORKS." PIRETC-Proceeding of The International Research Education & Training Centre 28, no. 07 (2023): 32–38. http://dx.doi.org/10.36962/piretc28072023-32.

Full text

Abstract:

The relevance of the topic is due to the high pace of development and implementation of new systems and processes in information structures and the lack of a methodology for determining the effectiveness of using new infocommunication technologies in them. Currently, there are no unified scientifically based methods for assessing the feasibility and effectiveness of using IP telephony technology. This is due to insufficient experience in the operation of telecommunication systems based on IP telephony technology and their significant difference from traditional telephone systems. It is indicated that for optimal planning of the location of switching nodes of IP-telephony networks, a methodology has been developed, consisting of the development of a mathematical basis for constructing the projected IP-telephony network, algorithmic implementation and estimation of the complexity of the implementation of this algorithm, which can be used in the design of real IP-telephony networks. The algorithmic implementation of the developed technique uses three arrays from among the nodes of the network, i.e. the first array contains labels with two values, the second array contains the distances - the current shortest distances from the specified vertex to the corresponding vertex, and the third array contains the vertex numbers. In turn, the algorithmic implementation depends on how the source vertex is found, how the set of unmarked vertices is stored, and how labels are updated. Keywords: Telecommunications network, IP-telephony technology, packet switching of flows, planning of the location of switching nodes, algorithmic implementation of the planning methodology, subscriber network, parameters of information systems, network parameters.

APA, Harvard, Vancouver, ISO, and other styles

21

GROOTE, JAN FRISO, and BAS PLOEGER. "SWITCHING GRAPHS." International Journal of Foundations of Computer Science 20, no. 05 (2009): 869–86. http://dx.doi.org/10.1142/s0129054109006930.

Full text

Abstract:

Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the same vertex and of which precisely one edge is enabled at any time. By using a Boolean function called a switch setting, the switches in a switching graph can be put in a fixed direction to obtain an ordinary graph. For many problems, switching graphs are a remarkable straightforward and natural model, but they have hardly been studied. We study the complexity of several natural questions in switching graphs of which some are polynomial, and others are NP-complete. We started investigating switching graphs because they turned out to be a natural framework for studying the problem of solving Boolean equation systems, which is equivalent to model checking of the modal µ-calculus and deciding the winner in parity games. We give direct, polynomial encodings of Boolean equation systems in switching graphs and vice versa, and prove correctness of the encodings.

APA, Harvard, Vancouver, ISO, and other styles

22

Kirkland, Steve, Sarah Plosker, and Xiaohong Zhang. "Switching and partially switching the hypercube while maintaining perfect state transfer." Quantum Information and Computation 19, no. 7&8 (2019): 541–54. http://dx.doi.org/10.26421/qic19.7-8-1.

Full text

Abstract:

A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with respect to inter-qubit interactions of a quantum system. We perform various perturbations to the hypercube graph---a graph that is known to exhibit PST---to create graphs that maintain many of the same properties of the hypercube, including PST as well as the distance for which PST occurs. We show that the sensitivity with respect to readout time errors remains unaffected for the vertices involved in PST. We give motivation for when these perturbations may be physically desirable or even necessary.

APA, Harvard, Vancouver, ISO, and other styles

23

Jayasekaran, C., and S. S. Athithiya. "Self-switching of union of two complete graphs." Gulf Journal of Mathematics 16, no. 2 (2024): 196–203. http://dx.doi.org/10.56947/gjom.v16i2.1880.

Full text

Abstract:

By a graph H = (V, E), we mean a finite undirected graph without loops and multiple edges. Let H be a graph and σ ⊆ V be a non–empty subset of V. Hσ is the graph obtained from H by removing all edges between σ and its complement V-σ and adding as edges all non-edges between σ and V-σ. Then σ is said to be a self-switching of H if H ≅ Hσ. It can also be referred to as k-vertex self-switching where k = |σ|. The set of all self-switchings of the graph H with cardinality k is represented by SSk(H) and its cardinality by ssk(H). A graph on m vertices in which each pair of distinct vertices are neighbors is called a complete graph and is denoted by Km. Km∪ Kn is the union of two complete graphs and is disconnected. In this paper, we give necessary and sufficient conditions for σ to be a self-switching for the graph H=Km ∪ Kn and using this, we find the cardinality ssk(H).

APA, Harvard, Vancouver, ISO, and other styles

24

Vaidya, S. K., and P. D. Ajani. "Restrained Edge Domination Number of Some Path Related Graphs." Journal of Scientific Research 13, no. 1 (2021): 145–51. http://dx.doi.org/10.3329/jsr.v13i1.48520.

Full text

Abstract:

For a graph G = (V,E), a set S ⊆ V(S ⊆ E) is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in V - S(E-S). The minimum cardinality of a restrained dominating (restrained edge dominating) set of G is called restrained domination (restrained edge domination) number of G, denoted by γr (G) (γre(G). The restrained edge domination number of some standard graphs are already investigated while in this paper the restrained edge domination number like degree splitting, switching, square and middle graph obtained from path.

APA, Harvard, Vancouver, ISO, and other styles

25

Vaidya, S. K., and P. D. Ajani. "Restrained Edge Domination Number of Some Path Related Graphs." Journal of Scientific Research 13, no. 1 (2021): 145–51. http://dx.doi.org/10.3329/jsr.v13i1.48520.

Full text

Abstract:

For a graph G = (V,E), a set S ⊆ V(S ⊆ E) is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in V - S(E-S). The minimum cardinality of a restrained dominating (restrained edge dominating) set of G is called restrained domination (restrained edge domination) number of G, denoted by γr (G) (γre(G). The restrained edge domination number of some standard graphs are already investigated while in this paper the restrained edge domination number like degree splitting, switching, square and middle graph obtained from path.

APA, Harvard, Vancouver, ISO, and other styles

26

Amara Jothi, A., and N. G. David. "On A-Vertex Consecutive Edge Bimagic Labeling for Switching Graphs." International Journal of Mathematics and Soft Computing 4, no. 2 (2014): 183. http://dx.doi.org/10.26708/ijmsc.2014.2.4.19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Vaidya, S. K., and R. M. Pandit. "Switching of a Vertex and Independent Domination Number in Graphs." International Journal of Mathematics and Soft Computing 6, no. 2 (2016): 33. http://dx.doi.org/10.26708/ijmsc.2016.2.6.04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Ellingham, M. N., and Gordon F. Royle. "Vertex-switching reconstruction of subgraph numbers and triangle-free graphs." Journal of Combinatorial Theory, Series B 54, no. 2 (1992): 167–77. http://dx.doi.org/10.1016/0095-8956(92)90048-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Barrientos, Christian. "On additive vertex labelings." Indonesian Journal of Combinatorics 4, no. 1 (2020): 34. http://dx.doi.org/10.19184/ijc.2020.4.1.5.

Full text

Abstract:

<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>In a quite general sense, additive vertex labelings are those functions that assign nonnegative integers to the vertices of a graph and the weight of each edge is obtained by adding the labels of its end-vertices. In this work we study one of these functions, called harmonious labeling. We calculate the number of non-isomorphic harmoniously labeled graphs with <em>n</em> edges and at most </span><span>n </span><span>vertices. We present harmonious labelings for some families of graphs that include certain unicyclic graphs obtained via the corona product. In addition, we prove that all <em>n</em>-cell snake polyiamonds are harmonious; this type of graph is obtained via edge amalgamation of n copies of the cycle <em>C</em><sub>3</sub> in such a way that each copy of this cycle shares at most two edges with other copies. Moreover, we use the edge-switching technique on the cycle <em>C</em><sub>4<em>t</em> </sub>to generate unicyclic graphs with another type of additive vertex labeling, called strongly felicitous, which has a solid bond with the harmonious labeling.</span></p></div></div></div>

APA, Harvard, Vancouver, ISO, and other styles

30

Jayasekaran, C., and A. Jancy Vini. "RESULTS ON RELATIVELY PRIME DOMINATION NUMBER OF VERTEX SWITCHING OF COMPLEMENT GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 4 (2020): 1601–9. http://dx.doi.org/10.37418/amsj.9.4.15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Gondalia, J. T. "ON FIBONACCI PRODUCT CORDIAL LABELING IN CONTEXT OF VERTEX SWITCHING OF GRAPHS." Advances and Applications in Discrete Mathematics 35 (November 21, 2022): 25–35. http://dx.doi.org/10.17654/0974165822049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

C. Jayasekaran and A. Vijila Rani. "Inverse isolate domination number on a vertex switching of cycle related graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2309–14. http://dx.doi.org/10.26637/mjm0804/0172.

Full text

Abstract:

Let \(G\) be non-trivial graph. A subset \(S \subset V(G)\) is called a isolate dominating set of \(G\) if is a dominating set and \(\delta(<S>)=0\). The set \(S^{\prime} \subset V(G)-S\) such that \(S^{\prime}\) is a dominating set of \(G\) and \(\delta\left(<S^{\prime}>\right)=0\), then \(S^{\prime}\) is called an inverse isolate dominating set with respect to \(S\). The minimum cardinality of an inverse isolate dominating set is called an inverse isolate dominating number and is denoted by \(\gamma_0^{-1}(G)\). In this paper we find inverse isolate dominating number on vertex switching of some cycle related graphs.

APA, Harvard, Vancouver, ISO, and other styles

33

NGO, HUNG Q., THANH-NHAN NGUYEN, and DUC T. HA. "ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM." Discrete Mathematics, Algorithms and Applications 01, no. 01 (2009): 127–39. http://dx.doi.org/10.1142/s1793830909000117.

Full text

Abstract:

When analyzing a nonblocking switching network, the typical problem is to find a route for a new request through the network without disturbing existing routes. By solving this problem, we can derive how many hardware components of a certain type (Banyan planes in a multi-log network, for instance) are needed for the network to be nonblocking. This scenario appears in virtually all combinations of switching environments: strictly, widesense or rearrangeably nonblocking, unicast or multicast switching, and circuit, multirate, or photonic switching. In this paper, we show that the König–Egevarý theorem is a very good tool which helps solve the above prototypical problem. The idea is to somehow "represent" the potential blocking connections as edges of a bipartite graph. The maximum number of blocking connections roughly corresponds to the size of a maximum matching in that bipartite graph. The size of any vertex cover, by the König–Egevarý theorem, is an upper bound on the maximum number of blocking connections. Thus, by specifying a small vertex cover, we can derive the sufficient number of hardware components for the network to be nonblocking. We illustrate the technique by analyzing crosstalk-free and non-crosstalk-free widesense nonblocking multicast multi-log networks. Particularly, for the first time in the literature we derive conditions for the d-ary multi-log network to be crosstalk-free multicast widesense nonblocking under the window algorithm for any given window size. Several by-products follow from our approach and results. Firstly, our results allow for computing the best window size minimizing the fabric cost, showing that the multi-log network is a good candidate for crosstalk-free multicast switching architectures. Secondly, the analytical approach also gives a much simpler proof of the known case when the network is not required to be crosstalk-free. Thirdly, we show that several known results for the multi-log multicast networks under the so-called fanout constraints are simple corollaries of our results.

APA, Harvard, Vancouver, ISO, and other styles

34

V., Ganesan, and K. Balamurugan Dr. "ON PRIME LABELING OF HERSCHEL GRAPH." International Journal of Engineering Research and Modern Education 1, no. 2 (2016): 33–42. https://doi.org/10.5281/zenodo.61834.

Full text

Abstract:

<em>A graph </em> <em> with vertex set </em> <em> is said to have a prime labeling if its vertices are labeled with distinct integers</em> <em> such that for each </em> <em> the labels assigned to </em> <em> and </em> <em> are relatively prime.  A graph which admits prime labeling is called a prime graph.In this paper, we investigate prime labeling of Herschel graph.  We also discuss prime labeling in the context of some graph operations namely Fusion, Duplication, Switching and Path union</em>

APA, Harvard, Vancouver, ISO, and other styles

35

V., Ganesan, and K. Balamurugan Dr. "PRIME LABELING FOR SOME SUNLET RELATED GRAPHS." International Journal of Scientific Research and Modern Education 1, no. 2 (2016): 1–10. https://doi.org/10.5281/zenodo.62009.

Full text

Abstract:

<em>A graph </em> <em> with vertex set </em> <em> is said to have a prime labeling if its vertices are labeled with distinct integers </em> <em> such that for each </em> <em> the labels assigned to </em> <em> and </em> <em> are relatively prime.A graph which admits prime labeling is called a prime graph. In this paper, we investigate prime labeling for some sunlet related graphs. We also discuss prime labeling in the context of some graph operations namely fusion, duplication, switching and path union.</em>

APA, Harvard, Vancouver, ISO, and other styles

36

V., Ganesan, and K. Balamurugan Dr. "ON PRIME LABELING OF THETA GRAPH." International Journal of Current Research and Modern Education 1, no. 2 (2016): 42–48. https://doi.org/10.5281/zenodo.62041.

Full text

Abstract:

<em>A graph </em><em> with vertex set </em><em> is said to have a prime labeling if its vertices are labeled with distinct integers</em> <em> such that for each edge </em><em> the labels assigned to </em><em> and </em><em> are relatively prime.  A graph which admits prime labeling is called a prime graph. In this paper; we investigate prime labeling of Theta graph.  We also discuss prime labeling in the context of some graph operations namely Fusion, Duplication, Switching and Path union</em>

APA, Harvard, Vancouver, ISO, and other styles

37

Sinha, Deepa, and Deepakshi Sharma. "Characterization of 2-Path Product Signed Graphs with Its Properties." Computational Intelligence and Neuroscience 2017 (2017): 1–8. http://dx.doi.org/10.1155/2017/1235715.

Full text

Abstract:

A signed graph is a simple graph where each edge receives a sign positive or negative. Such graphs are mainly used in social sciences where individuals represent vertices friendly relation between them as a positive edge and enmity as a negative edge. In signed graphs, we define these relationships (edges) as of friendship (“+” edge) or hostility (“-” edge). A 2-path product signed graph S#^S of a signed graph S is defined as follows: the vertex set is the same as S and two vertices are adjacent if and only if there exists a path of length two between them in S. The sign of an edge is the product of marks of vertices in S where the mark of vertex u in S is the product of signs of all edges incident to the vertex. In this paper, we give a characterization of 2-path product signed graphs. Also, some other properties such as sign-compatibility and canonically-sign-compatibility of 2-path product signed graphs are discussed along with isomorphism and switching equivalence of this signed graph with 2-path signed graph.

APA, Harvard, Vancouver, ISO, and other styles

38

M. Ganeshan. "Prime Labeling of Bull Graph." Communications on Applied Nonlinear Analysis 32, no. 2s (2024): 592–603. https://doi.org/10.52783/cana.v32.2520.

Full text

Abstract:

Let G be a graph. A bijection f:V→ {1,2,…..|V|} is called a prime labeling [3] if for each edge e=uv in E, we have GCD{ f(u),f(v)}=1. A graph that admits a prime labeling is said to be a prime graph. In this paper we show that bull graph admits Prime labeling in the context of variety graph operations namely duplication of vertex, fusion of vertices and Switching in Bull graph.

APA, Harvard, Vancouver, ISO, and other styles

39

Cavaleri, Matteo, and Alfredo Donno. "On cospectrality of gain graphs." Special Matrices 10, no. 1 (2022): 343–65. http://dx.doi.org/10.1515/spma-2022-0169.

Full text

Abstract:

Abstract We define G G -cospectrality of two G G -gain graphs ( Γ , ψ ) \left(\Gamma ,\psi ) and ( Γ ′ , ψ ′ ) \left(\Gamma ^{\prime} ,\psi ^{\prime} ) , proving that it is a switching isomorphism invariant. When G G is a finite group, we prove that G G -cospectrality is equivalent to cospectrality with respect to all unitary representations of G G . Moreover, we show that two connected gain graphs are switching equivalent if and only if the gains of their closed walks centered at an arbitrary vertex v v can be simultaneously conjugated. In particular, the number of switching equivalence classes on an underlying graph Γ \Gamma with n n vertices and m m edges, is equal to the number of simultaneous conjugacy classes of the group G m − n + 1 {G}^{m-n+1} . We provide examples of G G -cospectral switching nonisomorphic graphs and we prove that any gain graph on a cycle is determined by its G G -spectrum. Moreover, we show that when G G is a finite cyclic group, the cospectrality with respect to a faithful irreducible representation implies the cospectrality with respect to any other faithful irreducible representation, and that the same assertion is false in general.

APA, Harvard, Vancouver, ISO, and other styles

40

Agarwal, Avni, P. Harsha, Swati Vasishta, and S. Sivanantham. "Implementation of Special Function Unit for Vertex Shader Processor Using Hybrid Number System." Journal of Computer Networks and Communications 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/890354.

Full text

Abstract:

The world of 3D graphic computing has undergone a revolution in the recent past, making devices more computationally intensive, providing high-end imaging to the user. The OpenGL ES Standard documents the requirements of graphic processing unit. A prime feature of this standard is a special function unit (SFU), which performs all the required mathematical computations on the vertex information corresponding to the image. This paper presents a low-cost, high-performance SFU architecture with improved speed and reduced area. Hybrid number system is employed here in order to reduce the complexity of operations by suitably switching between logarithmic number system (LNS) and binary number system (BNS). In this work, reduction of area and a higher operating frequency are achieved with almost the same power consumption as that of the existing implementations.

APA, Harvard, Vancouver, ISO, and other styles

41

Guo, Qiao, Yaoping Hou, and Deqiong Li. "The least Laplacian eigenvalue of the unbalanced unicyclic signed graphs with $k$ pendant vertices." Electronic Journal of Linear Algebra 36, no. 36 (2020): 390–99. http://dx.doi.org/10.13001/ela.2020.5077.

Full text

Abstract:

Let $\Gamma=(G,\sigma)$ be a signed graph and $L(\Gamma)=D(G)-A(\Gamma)$ be the Laplacian matrix of $\Gamma$, where $D(G)$ is the diagonal matrix of vertex degrees of the underlying graph $G$ and $A(\Gamma)$ is the adjacency matrix of $\Gamma$. It is well-known that the least Laplacian eigenvalue $\lambda_n$ is positive if and only if $\Gamma$ is unbalanced. In this paper, the unique signed graph (up to switching equivalence) which minimizes the least Laplacian eigenvalue among unbalanced connected signed unicyclic graphs with $n$ vertices and $k$ pendant vertices is characterized.

APA, Harvard, Vancouver, ISO, and other styles

42

Jeyanthi, P., A. Maheswari, and M. Vijayalakshmi. "Further results on 3-product cordial labeling." Proyecciones (Antofagasta) 38, no. 2 (2019): 191–202. https://doi.org/10.22199/issn.0717-6279-3523.

Full text

Abstract:

A mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |vf(i) − vf(j)| ≤ 1 and |ef(i) − ef(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where vf(i) denotes the number of vertices labeled with i, ef(i) denotes the number of edges xy with f(x)f(y) ≡ i(mod 3). A graph with 3-product cordial labeing is called 3-product cordial graph. In this paper we establish that switching of an apex vertex in closed helm, double fan, book graph K1,n × K2 and permutation graph P (K2 + mK1, I) are 3-product cordial graphs.

APA, Harvard, Vancouver, ISO, and other styles

43

Ryu, Junghun, Eric Noel, and K. Wendy Tang. "Distributed and Fault-Tolerant Routing for Borel Cayley Graphs." International Journal of Distributed Sensor Networks 8, no. 10 (2012): 124245. http://dx.doi.org/10.1155/2012/124245.

Full text

Abstract:

We explore the use of a pseudorandom graph family, Borel Cayley graph family, as the network topology with thousands of nodes operating in a packet switching environment. BCGs are known to be an efficient topology in interconnection networks because of their small diameters, short average path lengths, and low-degree connections. However, the application of BCGs is hindered by a lack of size flexibility and fault-tolerant routing. We propose a fault-tolerant routing algorithm for BCGs. Our algorithm exploits the vertex-transitivity property of Borel Cayley graphs and relies on extra information to reflect topology change. Our results show that the proposed method supports good reachability and a small End-to-End delay under various link failures scenarios.

APA, Harvard, Vancouver, ISO, and other styles

44

Yadav, RN. "Signed graphs connected with the root lattice." BIBECHANA 11 (May 10, 2014): 157–60. http://dx.doi.org/10.3126/bibechana.v11i0.10396.

Full text

Abstract:

For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that each edge between the sets is negative and each edge within a set is positive. For a given signed graph Tsaranov, Siedel and Cameron constructed the corresponding root lattice. In the present work we have dealt with signed graphs corresponding to the root lattice An. A connected graph is called a Fushimi tree if its all blocks are complete subgraphs. A Fushimi tree is said to be simple when by deleting any cut vertex we have always two connected components. A signed Fushimi tree is called a Fushimi tree with standard sign if it can be transformed into a signed Fushimi tree whose all edges are signed by +1 by switching. Here we have proved that any signed graph corresponding to An is a simple Fushimi tree with standard sign. Our main result is that s simple Fushimi tree with standard sign is contained in the cluster given by a line. DOI: http://dx.doi.org/10.3126/bibechana.v11i0.10396 BIBECHANA 11(1) (2014) 157-160

APA, Harvard, Vancouver, ISO, and other styles

45

Gao, Hao, Yadong Zhang, and Jin Guo. "A Novel Dynamic Programming Approach for Optimizing Driving Strategy of Subway Trains." MATEC Web of Conferences 325 (2020): 01002. http://dx.doi.org/10.1051/matecconf/202032501002.

Full text

Abstract:

The reduction of operation energy consumption without decreasing service quality has become a great challenge in subways daily operation. A novel DP based approach is proposed for optimizing the train driving strategy. The optimal driving problem is first considered as a multi-objective problem with five optimal targets (i.e., energy saving, punctual arriving, less switching, safe driving and accurate stopping). The optimization problem is remodelled as a multistage decision problem by discretizing the continuous train movement in space. The process of dynamic programming is carried out in the velocity-space status space. Due to the discretizing rules of searching space, the optimal goals of safe driving and accurate stopping can be satisfied during the searching process. The rest of multiple goals are spilt into cost functions and constrains for each stage. Due to the multiple cost functions, a set of pareto optimal solutions can be achieved at each vertex during the process of dynamic programming. To further improve the efficiency of algorithm, two evaluation criterions are introduced to maintain the capacity of the pareto set at each vertex. A case study of Yizhuang urban rail line in Beijing is conducted to verify the effectiveness and the efficiency of DP based algorithms.

APA, Harvard, Vancouver, ISO, and other styles

46

Kim, Jonghoek. "Intruder capture algorithms considering visible intruders." International Journal of Advanced Robotic Systems 16, no. 3 (2019): 172988141984673. http://dx.doi.org/10.1177/1729881419846739.

Full text

Abstract:

In this article, we consider the problem of using multiple robots (searchers) to capture intruders in an environment. Assume that a robot can access the position of an intruder in real time, that is, an intruder is visible by a robot. We simplify the environment so that robots and worst-case intruders move along a weighted graph, which is a topological map of the environment. In such settings, a worst-case intruder is characterized by unbounded speed, complete awareness of searcher location and intent, and full knowledge of the search environment. The weight of an edge or a vertex in a weighted graph is a cost describing the clearing requirement of the edge or the vertex. This article provides non-monotone search algorithms to capture every visible intruder. Our algorithms are easy to implement, thus are suitable for practical robot applications. Based on the non-monotone search algorithms, we derive the minimum number of robots required to clear a weighted tree graph. Considering a general weighted graph, we derive bounds for the number of robots required. Finally, we present switching algorithms to improve the time efficiency of capturing intruders while not increasing the number of robots. We verify the effectiveness of our approach using MATLAB simulations.

APA, Harvard, Vancouver, ISO, and other styles

47

Beiner, L. "Combined time/location optimization of robotic motions with specified paths and velocity profiles." Robotica 7, no. 4 (1989): 309–14. http://dx.doi.org/10.1017/s026357470000669x.

Full text

Abstract:

SUMMARYA parameter optimization approach to the time-minimization of robotic motions along specified paths is presented for the case when: (i) the velocity profile is a prescribed sequence of constant acceleration/deceleration segments with unspecified, but bounded vertex velocities at given path stations; (ii) the relative robot/path location can be varied. Such optimizations occur when technological requirements impose a certain velocity profile along the path due to velocity and acceleration constraints. Full nonlinear manipulator dynamics and path parameterization are used to determine the optimal velocity profile and robot location consistent with the actuator/configuration limitations. No numerical integration or search for switching curve are involved in the solution. Examples of time-and-location optimized robotic motions with specified velocity profile are presented.

APA, Harvard, Vancouver, ISO, and other styles

48

Malik, Arshad Habib, Aftab Ahmed Memon, and Feroza Arshad. "Fractional order multi-scheduling parameters based LPV modelling and robust switching H∞ controllers design for steam dump system of nuclear power plant." Mehran University Research Journal of Engineering and Technology 41, no. 2 (2022): 197–207. http://dx.doi.org/10.22581/muet1982.2202.19.

Full text

Abstract:

In this research work, the highly challenging problem of novel modelling and nonlinear control of steam dump system of Pressurized Water Reactor (PWR) type Nuclear Power Plant (NPP) is attempted. The Fractional Order Multi- Scheduling Parameters based Multi-Input Single- Output Linear Parameter Varying (FO-MSP-MISO-LPV) model of Steam Dump System (SDS) is estimated with uncertain dynamics under sudden load variation transients. MSP for uncertain dynamics of SDS in FO framework is the most challenging problem and attempted in a novel fashion for the first time in nuclear industry. Scheduling parameters are dynamic in nature that makes the control problem more challenging. The Model is estimated experimentally by least square method using innovative plant operational data of opening positions of different valves as input variables and steam pressure as an output variable and cold leg coolant temperature coefficient of reactivity, hot leg coolant temperature coefficient, steam flow rate and turbine power as dynamic scheduling parameters. A switching controller is designed to address variable conditions of steam pressure for the actuation of dump valves, relief valves and safety valves in SDS. A robust fractional order LPV switching H∞ (RFO-LPV-SWH∞) controllers are formulated and designed for FO-MSP-MISO-LPV model. The design of RFO-LPV-SWH∞ controllers is another significant contribution in switching mode with non-integer and LPV hybrid framework. RFO-LPV-SWH∞ controllers are tested, simulated and validated against benchmark transients as laid down in Final Safety Analysis Report (FSAR) of PWR-type NPP. The input and output variables at first and second vertex of polytope are fast reference tracking under highly nonlinear uncertain dynamics of SDS. Closed loop simulation experiments are conducted and proved that the proposed closed framework is robust in performance under parametric uncertainty.

APA, Harvard, Vancouver, ISO, and other styles

49

Krishna, Remya, Deepak E. Soman, Sasi K. Kottayil, and Mats Leijon. "Synchronous Current Compensator for a Self-Balanced Three-Level Neutral Point Clamped Inverter." Advances in Power Electronics 2014 (April 29, 2014): 1–8. http://dx.doi.org/10.1155/2014/620607.

Full text

Abstract:

This paper presents a synchronous current control method for a three-level neutral point clamped inverter. Synchronous reference frame control based on two decoupled proportional-integral (PI) controllers is used to control the current in direct and quadrature axes. A phase disposition pulse width modulation (PDPWM) method in regular symmetrical sampling is used for generating the inverter switching signals. To eliminate the harmonic content with no phase errors, two first-order low pass filters (LPFs) are used for the dq currents. The simulation of closed-loop control is done in Matlab/Simulink. The Vertex-5 field programmable gate array (FPGA) in Labview/CompactRio is used for the implementation of the control algorithm. The control and switch pulse generation are done in independent parallel loops. The synchronization of both loops is achieved by controlling the length of waiting time for each loop. The simulation results are validated with experiments. The results show that the control action is reliable and efficient for the load current control.

APA, Harvard, Vancouver, ISO, and other styles

50

Amreen, J., and S. Naduvath. "Non-inverse signed graph of a group." Carpathian Mathematical Publications 16, no. 2 (2024): 565–74. https://doi.org/10.15330/cmp.16.2.565-574.

Full text

Abstract:

Let $G$ be a group with binary operation $\ast$. The non-inverse graph (in short, $i^*$-graph) of $G$, denoted by $\Gamma$, is a simple graph with vertex set consisting of elements of $G$ and two vertices $x, y \in \Gamma$ are adjacent if $x$ and $y$ are not inverses of each other. That is, $x- y$ if and only if $x\ast y \neq i_G \neq y \ast x$, where $i_G$ is the identity element of $G$. In this paper, we extend the study of $i^\ast$-graphs to signed graphs by defining $i^\ast$-signed graphs. We characterize the graphs for which the $i^\ast$-signed graphs and negated $i^\ast$-signed graphs are balanced, sign-compatible, consistent and $k$-clusterable. We also obtain the frustration index of the $i^\ast$-signed graph. Further, we characterize the homogeneous non-inverse signed graphs and study the properties like net-regularity and switching equivalence.

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!