Zaloguj się

Gotowe bibliografie tematyczne / Vertex switching / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Vertex switching.

Artykuły w czasopismach na temat „Vertex switching”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

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

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Vertex switching”.

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

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

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

4

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 arb

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 verte

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 indicat

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 switchin

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 remai

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 neig

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 m

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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 m

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

<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 harmoni

Style APA, Harvard, Vancouver, ISO itp.

30

Gurski, Frank, and Robin Weishaupt. "The Behavior of Tree-Width and Path-Width Under Graph Operations and Graph Transformations." Algorithms 18, no. 7 (2025): 386. https://doi.org/10.3390/a18070386.

Pełny tekst źródła

Streszczenie:

Tree-width and path-width are well-known graph parameters. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded tree-width or bounded path-width. In this work, we study the behavior of tree-width and path-width under various unary and binary graph transformations. For considered transformations, we provide upper and lower bounds for the tree-width and path-width of the resulting graph in terms of those of the initial graphs or argue why such bounds are impossible to specify. Among the studied unary transformations are vertex addition, vertex deletion

Style APA, Harvard, Vancouver, ISO itp.

31

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

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.

Pełny tekst źródła

Streszczenie:

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 sw

Style APA, Harvard, Vancouver, ISO itp.

34

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.

Pełny tekst źródła

Streszczenie:

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ý

Style APA, Harvard, Vancouver, ISO itp.

35

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

36

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

37

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

38

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.

Pełny tekst źródła

Streszczenie:

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 prod

Style APA, Harvard, Vancouver, ISO itp.

39

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

40

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.

Pełny tekst źródła

Streszczenie:

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 class

Style APA, Harvard, Vancouver, ISO itp.

41

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

42

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

43

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

44

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.

Pełny tekst źródła

Streszczenie:

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 informatio

Style APA, Harvard, Vancouver, ISO itp.

45

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.

Pełny tekst źródła

Streszczenie:

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 subgra

Style APA, Harvard, Vancouver, ISO itp.

46

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

47

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.

Pełny tekst źródła

Streszczenie:

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 weighte

Style APA, Harvard, Vancouver, ISO itp.

48

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

49

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.

Pełny tekst źródła

Streszczenie:

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 pa

Style APA, Harvard, Vancouver, ISO itp.

50

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.

Pełny tekst źródła

Streszczenie:

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/Simuli

Style APA, Harvard, Vancouver, ISO itp.

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