Zaloguj się

Gotowe bibliografie tematyczne / Degree splitting graph / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Degree splitting graph.

Artykuły w czasopismach na temat „Degree splitting graph”

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 „Degree splitting graph”.

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

Basavanagoud, B., and Roopa S. Kusugal. "On the Line Degree Splitting Graph of a Graph." Bulletin of Mathematical Sciences and Applications 18 (May 2017): 1–10. http://dx.doi.org/10.18052/www.scipress.com/bmsa.18.1.

Pełny tekst źródła

Streszczenie:

In this paper, we introduce the concept of the line degree splitting graph of a graph. We obtain some properties of this graph. We find the girth of the line degree splitting graphs. Further, we establish the characterization of graphs whose line degree splitting graphs are eulerian, complete bipartite graphs and complete graphs.

Style APA, Harvard, Vancouver, ISO itp.

2

Zhang, Xiujun, Ahmad Bilal, M. Mobeen Munir, and Hafiz Mutte ur Rehman. "Maximum degree and minimum degree spectral radii of some graph operations." Mathematical Biosciences and Engineering 19, no. 10 (2022): 10108–21. http://dx.doi.org/10.3934/mbe.2022473.

Pełny tekst źródła

Streszczenie:

<abstract><p>New results relating to the maximum and minimum degree spectral radii of generalized splitting and shadow graphs have been constructed on the basis of any regular graph, referred as base graph. In particular, we establish the relations of extreme degree spectral radii of generalized splitting and shadow graphs of any regular graph.</p></abstract>

Style APA, Harvard, Vancouver, ISO itp.

3

Dominic, Charles. "Zero forcing number of degree splitting graphs and complete degree splitting graphs." Acta Universitatis Sapientiae, Mathematica 11, no. 1 (2019): 40–53. http://dx.doi.org/10.2478/ausm-2019-0004.

Pełny tekst źródła

Streszczenie:

Abstract A subset ℤ ⊆ V(G) of initially colored black vertices of a graph G is known as a zero forcing set if we can alter the color of all vertices in G as black by iteratively applying the subsequent color change condition. At each step, any black colored vertex has exactly one white neighbor, then change the color of this white vertex as black. The zero forcing number ℤ (G), is the minimum number of vertices in a zero forcing set ℤ of G (see [11]). In this paper, we compute the zero forcing number of the degree splitting graph (𝒟𝒮-Graph) and the complete degree splitting graph (𝒞𝒟𝒮-Graph) o

Style APA, Harvard, Vancouver, ISO itp.

4

Ibrahim, Arooj, and Saima Nazeer. "On Maximum Degree and Maximum Reverse Degree Energies of Splitting and Shadow graph of Complete graph." Utilitas Mathematica 119, no. 1 (2024): 73–82. http://dx.doi.org/10.61091/um119-08.

Pełny tekst źródła

Streszczenie:

In this paper, the relations of maximum degree energy and maximum reserve degree energy of a complete graph after removing a vertex have been shown to be proportional to the energy of the complete graph. The results of splitting the graph and shadow graphs are also presented for the complete graph after removing a vertex.

Style APA, Harvard, Vancouver, ISO itp.

5

Mirajkar, Keerthi G., and Y. B. Priyanka. "The Sum Degree Distance and the Product Degree Distance of Generalized Transformation Graphs G^ab." Bulletin of Mathematical Sciences and Applications 16 (August 2016): 76–88. http://dx.doi.org/10.18052/www.scipress.com/bmsa.16.76.

Pełny tekst źródła

Streszczenie:

In this contribution, we consider line splitting graph LS(G) of a graph G as transformation graph G++ of Gab. We investigate the sum degree distance DD+(G) and product degree distance DD*(G) of transformation graph Gab, which are weighted version of Wiener index. The Transformation graphs of Gab are G++, G+-, G-+ and G--.

Style APA, Harvard, Vancouver, ISO itp.

6

Anitha, J., and S. Muthukumar. "Power domination in splitting and degree splitting graph." Proyecciones (Antofagasta) 40, no. 6 (2021): 1641–55. http://dx.doi.org/10.22199/issn.0717-6279-4357-4641.

Pełny tekst źródła

Streszczenie:

A vertex set S is called a power dominating set of a graph G if every vertex within the system is monitored by the set S following a collection of rules for power grid monitoring. The power domination number of G is the order of a minimal power dominating set of G. In this paper, we solve the power domination number for splitting and degree splitting graph.

Style APA, Harvard, Vancouver, ISO itp.

7

Falcón, Raúl M., Venkitachalam Aparna, and Nagaraj Mohanapriya. "Optimal secret share distribution in degree splitting communication networks." Networks and Heterogeneous Media 18, no. 4 (2023): 1713–46. http://dx.doi.org/10.3934/nhm.2023075.

Pełny tekst źródła

Streszczenie:

<abstract><p>Dynamic coloring has recently emerged as a valuable tool to optimize cryptographic protocols based on secret sharing, which enforce data security in communication networks and have significant importance in both online storage and cloud computing. This type of graph labeling enables the dealer to distribute secret shares among the nodes of a communication network so that everybody can recover the secret after a minimum number of rounds of communication. This paper delves into this topic by dealing with the dynamic coloring problem for degree splitting graphs. The topol

Style APA, Harvard, Vancouver, ISO itp.

8

Kaneria, V. J., and J. M. Shah. "ABSOLUTE MEAN GRACEFUL LABELING IN THE CONTEXT OF m-SPLITTING AND DEGREE SPLITTING GRAPHS." South East Asian J. of Mathematics and Mathematical Sciences 19, no. 03 (2023): 359–70. http://dx.doi.org/10.56827/seajmms.2023.1903.28.

Pełny tekst źródła

Streszczenie:

A graph G with q edges is said to be absolute mean graceful if there is a one-to-one function f from V (G) to the set {0,±1,±2,±3,...,±q} such that when each edge xy is assigned the label |f(x)−f(y)| 2 , then the resulting edge labels are distinct. In this paper, the absolute mean graceful labeling of m-splitting and degree splitting graphs of some graphs are investigated.

Style APA, Harvard, Vancouver, ISO itp.

9

Kalaivani, R., and D. Vijayalakshmi. "On dominator coloring of degree splitting graph of some graphs." Journal of Physics: Conference Series 1139 (December 2018): 012081. http://dx.doi.org/10.1088/1742-6596/1139/1/012081.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Mohanappriya, G., and D. Vijayalakshmi. "Degree based topological invariants of splitting graph." Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics 68, no. 2 (2019): 1341–49. http://dx.doi.org/10.31801/cfsuasmas.526546.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

T. K., Jahfar, and Chithra A. V. "Energy and Randić energy of special graphs." Proyecciones (Antofagasta) 41, no. 4 (2022): 855–77. http://dx.doi.org/10.22199/issn.0717-6279-4616.

Pełny tekst źródła

Streszczenie:

In this paper, we determine the Randić energy of the m-splitting graph, the m-shadow graph and the m-duplicate graph of a given graph, m being an arbitrary integer. Our results allow the construction of an infinite sequence of graphs having the same Randić energy. Further, we determine some graph invariants like the degree Kirchhoff index, the Kemeny’s constant and the number of spanning trees of some special graphs. From our results, we indicate how to obtain infinitely many pairs of equienergetic graphs, Randić equienergetic graphs and also, infinite families of integral graphs.

Style APA, Harvard, Vancouver, ISO itp.

12

Vaidya, S. K., and N. H. Shah. "On Square Divisor Cordial Graphs." Journal of Scientific Research 6, no. 3 (2014): 445–55. http://dx.doi.org/10.3329/jsr.v6i3.16412.

Pełny tekst źródła

Streszczenie:

The square divisor cordial labeling is a variant of cordial labeling and divisor cordial labeling. Here we prove that the graphs like flower Fln, bistar Bn,n, square graph of Bn,n, shadow graph of Bn,n as well as splitting graphs of star Kl,n and bistar Bn,n are square divisor cordial graphs. Moreover we show that the degree splitting graphs of Bn,n and Pn admit square divisor cordial labeling. © 2014 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.doi: http://dx.doi.org/10.3329/jsr.v6i3.16412 J. Sci. Res. 6 (3), 445-455 (2014)

Style APA, Harvard, Vancouver, ISO itp.

13

J. Suji Priya, T. Muthu Nesa Beula. "The Monophonic Metric Dimension of Degree Splitting Graph." Tuijin Jishu/Journal of Propulsion Technology 44, no. 4 (2023): 2742–47. http://dx.doi.org/10.52783/tjjpt.v44.i4.1350.

Pełny tekst źródła

Streszczenie:

Let be a simple graph and be an ordered set and. The representation of with respect to is the -tuple . Then is called a monophonic resolving set if different vertices of have different representations with respect to . A monophonic resolving set of minimum number of elements is called a minimum monophonic set for and its cardinality is known as the monophonic metric dimension of , represented by In this article, we determined the monophonic metric dimension of degree splitting graph.

Style APA, Harvard, Vancouver, ISO itp.

14

S. K. Vaidya and Rakhimol V. Isaac. "The b-chromatic number of some degree splitting graphs." Malaya Journal of Matematik 2, no. 03 (2014): 249–53. http://dx.doi.org/10.26637/mjm203/010.

Pełny tekst źródła

Streszczenie:

A $b$-coloring of a graph $G$ is a variant of proper coloring in which each color class contains a vertex that has a neighbor in all the other color classes. We investigate some results on $b$-coloring in the context of degree splitting graph of $P_n, B_{n, n}, S_n$ and $G_n$.

Style APA, Harvard, Vancouver, ISO itp.

15

Tamm, Mikhail V., Dmitry G. Koval, and Vladimir I. Stadnichuk. "Polygon-Based Hierarchical Planar Networks Based on Generalized Apollonian Construction." Physics 3, no. 4 (2021): 998–1014. http://dx.doi.org/10.3390/physics3040063.

Pełny tekst źródła

Streszczenie:

Experimentally observed complex networks are often scale-free, small-world and have an unexpectedly large number of small cycles. An Apollonian network is one notable example of a model network simultaneously having all three of these properties. This network is constructed by a deterministic procedure of consequentially splitting a triangle into smaller and smaller triangles. In this paper, a similar construction based on the consequential splitting of tetragons and other polygons with an even number of edges is presented. The suggested procedure is stochastic and results in the ensemble of p

Style APA, Harvard, Vancouver, ISO itp.

16

A. Punitha. "On Total Coloring of Triple Star and Lobster Graphs." Communications on Applied Nonlinear Analysis 31, no. 8s (2024): 494–504. http://dx.doi.org/10.52783/cana.v31.1543.

Pełny tekst źródła

Streszczenie:

A k-total coloring of a graph G is an assignment of k colors to the elements (vertices and edges) of G such that adjacent or incident elements have different colors. The total chromatic number is the smallest integer k for which G has a k-total coloring. The well-known Total Coloring Conjecture asserts that the total chromatic number of a graph is either ∆(G) + 1 or ∆(G) + 2, where ∆(G) is the maximum degree of G. In this paper, we consider the triple star graph, lobster graph and its line, middle, total graphs and also splitting graph of triple star. We obtained the preceding graphs has total

Style APA, Harvard, Vancouver, ISO itp.

17

Thilakam, K., and A. Sumathi. "Wiener Index of Degree Splitting Graph of some Hydrocarbons." International Journal of Computer Applications 93, no. 3 (2014): 27–31. http://dx.doi.org/10.5120/16196-5454.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Barasara, C. M., and Y. B. Thakkar. "DIVISOR CORDIAL LABELING FOR SOME SNAKES AND DEGREE SPLITTING RELATED GRAPHS." South East Asian J. of Mathematics and Mathematical Sciences 19, no. 01 (2023): 211–24. http://dx.doi.org/10.56827/seajmms.2023.1901.17.

Pełny tekst źródła

Streszczenie:

For a graph G = (V (G),E(G)), the vertex labeling function is defined as a bijection f : V (G) → {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if one f(u) or f(v) divides the other and 0 otherwise. f is called divisor cordial labeling of graph G if the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In 2011, Varatharajan et al. [24] have introduced divisor cordial labeling as a variant of cordial labeling. In this paper, we study divisor cordial labeling for triangular snake and quadrilateral snake. Moreover, we investigate divi

Style APA, Harvard, Vancouver, ISO itp.

19

V.T. Brindha Mary, C. David Raj, and C. Jayasekaran. "Radio even mean graceful labeling on some special graphs." Malaya Journal of Matematik 8, no. 04 (2020): 2323–28. http://dx.doi.org/10.26637/mjm0804/0175.

Pełny tekst źródła

Streszczenie:

Radio Even Mean Graceful Labeling of a connected graph \(G\) is a bijection \(\phi\) from the vertex set \(V(G)\) to \(\{2,4,6, \ldots 2|V|\}\) satisfying the condition \(d(s, t)+\left\lceil\frac{\phi(s)+\phi(t)}{2}\right\rceil \geq 1+\operatorname{diam}(G)\) for every \(\mathrm{s}, \mathrm{t} \in \mathrm{V}(\mathrm{G})\). A graph which admits radio even mean graceful labeling is called radio even mean graceful graph. In this paper we investigate the radio even mean graceful labeling on degree splitting of some special graphs.

Style APA, Harvard, Vancouver, ISO itp.

20

Vaidya, S. K., and C. M. Barasara. "PRODUCT AND EDGE PRODUCT CORDIAL LABELING OF DEGREE SPLITTING GRAPH OF SOME GRAPHS." Advances and Applications in Discrete Mathematics 15, no. 1 (2015): 61–74. http://dx.doi.org/10.17654/aadmjan2015_061_074.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Isaac, Rakhimol, and Parashree Pandya. "On Paired Domination of Some Graphs." Journal of Computational Mathematica 6, no. 2 (2022): 116–20. http://dx.doi.org/10.26524/cm153.

Pełny tekst źródła

Streszczenie:

   For a graph a subset D of the vertex set is called a dominating set if every vertex in is adjacent to some vertex in D. The domination number is the minimum cardinality of a dominating set of a graph G. The paired dominating set of a graph is a dominating set and the subgraph induced by it contains a perfect matching. The paired domination number is the minimum cardinality of a paired dominating set in G. In this paper, we discuss the paired domination number of the graphs obtained by the kth power of path and cycle and degree splitting graphs of some standard graphs.&#x0D

Style APA, Harvard, Vancouver, ISO itp.

22

V. T., Brindha Mary, C. David Raj, and C. Jayasekaran. "EVEN RADIO MEAN GRACEFUL LABELING ON DEGREE SPLITTING OF SNAKE RELATED GRAPHS." South East Asian J. of Mathematics and Mathematical Sciences 18, no. 02 (2022): 197–204. http://dx.doi.org/10.56827/seajmms.2022.1802.18.

Pełny tekst źródła

Streszczenie:

A radio mean labeling of a connected graph G is an injection φ from the vertex set V(G) to N such that the condition d(u, v) + & φ(u)+φ(v) 2 ' ≥ 1 + diam(G) holds for any two distinct vertices u and v of G. A graph which admits radio mean labeling is called radio mean graph. The radio mean number of φ, rmn(φ), is the maximum number assigned to any vertex of G. The radio mean number of G, rmn(G), is the minimum value of rmn(φ) taken over all radio mean labeling φ of G. In this paper we introduce a new concept even radio mean graceful labeling and we investigate th

Style APA, Harvard, Vancouver, ISO itp.

23

Sunoj, B.S, and Varkey T.K Mathew. "Linear Incidence Edge Prime Labeling – More Results on Path Related Di Graphs." Indian Journal of Science and Technology 13, no. 2 (2020): 141–48. https://doi.org/10.17485/ijst/2020/v13i02/148783.

Pełny tekst źródła

Streszczenie:

Abstract <strong>Objectives:</strong> Our aim is to find new families of di graphs that admit linear incidence edge prime labeling. <strong>Methods/statistical analysis: </strong>Here the vertices are assigned with 0,1,…,m−1 and edges with 2g(v) + g(u), where u is the initial vertex and v is the terminal vertex and g is the vertex labeling function. The graph is prime when the greatest common incidence number of vertices with in degree greater than one is one. <strong>Findings:</strong> Here we prove that di graph of corona product of P<sub>n</sub> with K<sub>2

Style APA, Harvard, Vancouver, ISO itp.

24

Vaidya, S. K., and N. H. Shah. "Some New Results on Prime Cordial Labeling." ISRN Combinatorics 2014 (March 23, 2014): 1–9. http://dx.doi.org/10.1155/2014/607018.

Pełny tekst źródła

Streszczenie:

A prime cordial labeling of a graph G with the vertex set V(G) is a bijection f:V(G)→{1,2,3,…,|V(G)|} such that each edge uv is assigned the label 1 if gcd(f(u),f(v))=1 and 0 if gcd(f(u),f(v))>1; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this work we give a method to construct larger prime cordial graph using a given prime cordial graph G. In addition to this we have investigated the prime cordial labeling for double fan and degree splitting graphs of p

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

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.

27

Mezić, Igor, Vladimir A. Fonoberov, Maria Fonoberova, and Tuhin Sahai. "Spectral Complexity of Directed Graphs and Application to Structural Decomposition." Complexity 2019 (January 1, 2019): 1–18. http://dx.doi.org/10.1155/2019/9610826.

Pełny tekst źródła

Streszczenie:

We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and nonrecurrent parts. We define the spectral complexity metric in terms of the spectrum of the recurrence matrix (associated with the reccurent part of the graph) and the Wasserstein distance. We show that the total complexity of the graph can then be defined in terms of the spectral complexity, complexities of individual components, and edge weights. The essential property of the spectral complexity metric is that it accounts for directe

Style APA, Harvard, Vancouver, ISO itp.

28

Zhong, Jinqin, Jieqing Tan, Yingying Li, Lichuan Gu, and Guolong Chen. "Multi-Targets Tracking Based On Bipartite Graph Matching." Cybernetics and Information Technologies 14, no. 5 (2014): 78–87. http://dx.doi.org/10.2478/cait-2014-0045.

Pełny tekst źródła

Streszczenie:

Abstract Multi-target tracking is a challenge due to the variable number of targets and the frequent interaction between targets in complex dynamic environments. This paper presents a multi-target tracking algorithm based on bipartite graph matching. Unlike previous approaches, the method proposed considers the target tracking as a bipartite graph matching problem where the nodes of the bipartite graph correspond to the targets in two neighboring frames, and the edges correspond to the degree of the similarity measure between the targets in different frames. Finding correspondence between the

Style APA, Harvard, Vancouver, ISO itp.

29

Vaidya, S. K., and A. D. Parmar. "Some More Results on Total Equitable Bondage Number of A Graph." Journal of Scientific Research 11, no. 3 (2019): 303–9. http://dx.doi.org/10.3329/jsr.v11i3.40573.

Pełny tekst źródła

Streszczenie:

The bondage number b(G) of a nonempty graph G is the minimum cardinality among all sets of edges E0 ⊆ E(G) for which γ(G-E0) > γ (G). An equitable dominating set D is called a total equitable dominating set if the induced subgraph < D > has no isolated vertices. The total equitable domination number γte(G) of G is the minimum cardinality of a total equitable dominating set of G. If γte(G) ≠ |V(G)| and <G-E0> contains no isolated vertices then the total equitable bondage number bte(G) of a graph G is the minimum cardinality among all sets of edges E0 ⊆ E(G) for which γte(G-E0) &g

Style APA, Harvard, Vancouver, ISO itp.

30

Yakshin, S. V. "An analytical method for solving the problem of heat network load flow." Proceedings of Irkutsk State Technical University 25, no. 1 (2021): 80–96. http://dx.doi.org/10.21285/1814-3520-2021-1-80-96.

Pełny tekst źródła

Streszczenie:

The author aimed to develop an analytical solution to the problem of the load flow of a six-, eleven- and twelve-circuit heat network, as well as to solve the problem of optimisation of a multi-circuit heat network, including the choice of the objective function and the determination of a number of variable technical parameters. For accelerating the optimisation process, the method of decomposition of the heat network graph was used. Decomposition involves is cutting the network graph at some nodes for the transition of a multi-circuit scheme to a branched scheme in the form of a tree. Optimis

Style APA, Harvard, Vancouver, ISO itp.

31

Monsalve, Juan, and Juan Rada. "Energy of a digraph with respect to a VDB topological index." Special Matrices 10, no. 1 (2022): 417–26. http://dx.doi.org/10.1515/spma-2022-0171.

Pełny tekst źródła

Streszczenie:

Abstract Let D D be a digraph with vertex set V V and arc set E E . For a vertex u u , the out-degree and in-degree of u u are denoted by d u + {d}_{u}^{+} and d u − {d}_{u}^{-} , respectively. A vertex-degree-based (VDB) topological index φ \varphi is defined for D D as φ ( D ) = 1 2 ∑ u v ∈ E φ d u + , d v − , \varphi (D)=\frac{1}{2}\sum _{uv\in E}{\varphi }_{{d}_{u}^{+},{d}_{v}^{-}}, where φ i , j {\varphi }_{i,j} is an appropriate function which satisfies φ i , j = φ j , i {\varphi }_{i,j}={\varphi }_{j,i} . In this work, we introduce the energy ℰ φ ( D ) {{\mathcal{ {\mathcal E} }}}_{\var

Style APA, Harvard, Vancouver, ISO itp.

32

Sahoo, Tapasmini, and Kunal Kumar Das. "Brain Tumor Localization Using N-Cut." International Journal of Online and Biomedical Engineering (iJOE) 19, no. 15 (2023): 92–102. http://dx.doi.org/10.3991/ijoe.v19i15.41641.

Pełny tekst źródła

Streszczenie:

A brain tumor is an abnormal collection of tissue in the brain. When tumors form, they are classified as either malignant or benign. It is critical to notice and identify the existence of tumors in brain images since they can be life threatening. This paper illustrates a novel segmentation method in which threshold technique is combined with normalized cut (Ncut) for the segregation of the tumors from brain magnetic resonance (MR) images. Image segmentation is a technique for grouping images. It is a method of splitting an image into sections with comparable attributes such as intensity, textu

Style APA, Harvard, Vancouver, ISO itp.

33

Xu, Hanyi, Guozhen Cheng, Xiaohan Yang, Wenyan Liu, Dacheng Zhou, and Wei Guo. "Multi-Dimensional Moving Target Defense Method Based on Adaptive Simulated Annealing Genetic Algorithm." Electronics 13, no. 3 (2024): 487. http://dx.doi.org/10.3390/electronics13030487.

Pełny tekst źródła

Streszczenie:

Due to the fine-grained splitting of microservices and frequent communication between microservices, the exposed attack surface of microservices has exploded, facilitating the lateral movement of attackers between microservices. To solve this problem, a multi-dimensional moving target defense method based on an adaptive simulated annealing genetic algorithm (MD2RS) is proposed. Firstly, according to the characteristics of microservices in the cloud, a microservice attack graph is proposed to quantify the attack scenario of microservices in the cloud so as to conveniently and intuitively observ

Style APA, Harvard, Vancouver, ISO itp.

34

Avadayappan, Selvam, M. Bhuvaneshwari, and Rajeev Gandhi. "Distance in Degree Splitting Graphs." International Journal of Engineering Research and Applications 07, no. 07 (2017): 14–21. http://dx.doi.org/10.9790/9622-0707061421.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Vaidya, S. K., and N. J. Kothari. "DOMINATION INTEGRITY OF SPLITTING AND DEGREE SPLITTING GRAPHS OF SOME GRAPHS." Advances and Applications in Discrete Mathematics 17, no. 2 (2016): 185–99. http://dx.doi.org/10.17654/dm017020185.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Sandhya, S. S., E. Ebin Raja Merly, and S. D. Deepa. "Degree Splitting of Heronian Mean Graphs." Journal of Mathematics Research 8, no. 5 (2016): 48. http://dx.doi.org/10.5539/jmr.v8n5p48.

Pełny tekst źródła

Streszczenie:

<p><span lang="EN-US"><span style="font-family: 宋体; font-size: medium;">In this paper, we prove Heronian Mean labeling of some degree splitting graphs. Already we have proved Heronian Mean labeling for some standard graphs. Here we prove that degree splitting of Path <span lang="EN-US">P<sub>3</sub></span></span></span><span lang="EN-US"><span style="font-family: 宋体; font-size: medium;">, Path <span lang="EN-US">P<sub>4</sub></span>, <span lang="EN-US">P<sub>3</sub>ʘK<sub>1</sub

Style APA, Harvard, Vancouver, ISO itp.

37

HSIEH, CHEN-CHUNG, and HSI-JIAN LEE. "A PROBABILISTIC STROKE-BASED VITERBI ALGORITHM FOR HANDWRITTEN CHINESE CHARACTERS RECOGNITION." International Journal of Pattern Recognition and Artificial Intelligence 07, no. 02 (1993): 329–52. http://dx.doi.org/10.1142/s0218001493000170.

Pełny tekst źródła

Streszczenie:

This paper proposes a probabilistic approach to recognize handwritten Chinese characters. According to the stroke writing sequence, strokes and interleaved stroke relations are built manually as a 1-D string, called an on-line model, to describe a Chinese character. In an input character, strokes are first extracted by a tree searching method. The recognition problem is then formulated as an optimization matching problem in a multistage directed graph, where the number of stages is the length of the modelled stroke sequence. Nodes in a stage represent extracted strokes that have the same strok

Style APA, Harvard, Vancouver, ISO itp.

38

Somasundaram, S., S. S. Sandhya, and S. P. Viji. "Geometric mean labeling on Degree splitting graphs." Journal of Discrete Mathematical Sciences and Cryptography 19, no. 2 (2016): 305–20. http://dx.doi.org/10.1080/09720529.2015.1084781.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Sandhya, S. S., S. Somasundaram, and S. Anusa. "Degree Splitting of Root Square Mean Graphs." Applied Mathematics 06, no. 06 (2015): 940–52. http://dx.doi.org/10.4236/am.2015.66086.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Vaidya, S. K., and R. M. Pandit. "Global equitable domination in some degree splitting graphs." Notes on Number Theory and Discrete Mathematics 24, no. 2 (2018): 74–84. http://dx.doi.org/10.7546/nntdm.2018.24.2.74-84.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Ulagammal, S., and Vernold Vivin J. "On star coloring of degree splitting of join graphs." Proyecciones (Antofagasta) 38, no. 5 (2019): 1071–80. http://dx.doi.org/10.22199/issn.0717-6279-2019-05-0069.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Prajapati, U. M., and P. A. Patel. "Product Binary L-Cordial Labeling of Various Degree Splitting Graphs." Communications in Mathematics and Applications 15, no. 1 (2024): 417–29. http://dx.doi.org/10.26713/cma.v15i1.2541.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

K, Bhuvaneswari, and Jagadeeswari P. "Square Difference Labeling For Tree Related and Degree Splitting Graphs." International Journal of Mathematics Trends and Technology 66, no. 10 (2020): 140–46. http://dx.doi.org/10.14445/22315373/ijmtt-v66i10p516.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

K, John Bosco, and Dinesh M. "On Radio Heronian D-distance Mean Number of Degree Splitting Graphs." International Journal of Mathematics Trends and Technology 67, no. 2 (2021): 114–20. http://dx.doi.org/10.14445/22315373/ijmtt-v67i2p516.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

avi, S. Rag. "The First and Second Zagreb Indices of Degree Splitting of Graphs." International Journal of Mathematics Trends and Technology 65, no. 2 (2019): 31–36. http://dx.doi.org/10.14445/22315373/ijmtt-v65i2p507.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Rajasekariah, G.-Halli, Samuel K. Martin, Anthony M. Smithyman, and Bernard J. Hudson. "Relevance of Plasmodium falciparum Biomarkers in the Treatment and Control of Malaria." European Journal of Medical and Health Sciences 5, no. 1 (2023): 31–40. http://dx.doi.org/10.24018/ejmed.2023.5.1.1450.

Pełny tekst źródła

Streszczenie:

We report here a dual-ELISA method to measure Malaria biomarkers concurrently in the same aliquot of blood sample. A correlation between the parasite numbers and ELISA values determined and the figures were used to establish a standard graph. Thick blood smears prepared from spiked blood samples were also Giemsa stained and parasite density determined by microscopy (It was thereby possible to undertake an objective comparison between lactate dehydrogenase and histidine- rich- proteins levels assessed by ELISA and parasite density determined by microscopy from the same spiked aliquot). The pres

Style APA, Harvard, Vancouver, ISO itp.

47

Vaidya, S. K., and G. K. Rathod. "On Randić energy of graphs." Proyecciones (Antofagasta) 42, no. 1 (2023): 205–18. http://dx.doi.org/10.22199/issn.0717-6279-4330.

Pełny tekst źródła

Streszczenie:

Let di be the degree of vertex vi of G then Randić matrix R(G) = [rij ] is defined as rij = 1/ √didj, if the vertices vi and vj are adjacent in G or rij = 0, otherwise. The Randić energy is the sum of absolute values of the eigenvalues of R(G). In this paper we have investigated Randić energy of m-Splitting and m-Shadow graphs. We also have constructed a sequence of graphs having same Randić energy.

Style APA, Harvard, Vancouver, ISO itp.

48

Mazurok, Igor Y., Yevhen Y. Leonchyk, Sergii S. Grybniak, Oleksandr S. Nashyvan, and Ruslan O. Masalskyi. "An incentive system for decentralized DAG-based platforms." Applied Aspects of Information Technology 5, no. 3 (2022): 196–207. http://dx.doi.org/10.15276/aait.05.2022.13.

Pełny tekst źródła

Streszczenie:

Decentralized public platforms are becoming increasingly popular due to a growing number of applications for various areas ofbusiness, finance, and social life. Authorless nodes can easily join such networks without any confirmation, making a transparent system of rewards and punishments crucial for the self-sustainability of public platforms. To achieve this, a system for incentivizing and punishing Workers’ behavior should be tightly harmonized with the corresponding consensus protocol, taking into account all of its features, and facilitating a favorable and supportive environment with equa

Style APA, Harvard, Vancouver, ISO itp.

49

BALL, CARSTEN F., and DIETER A. MLYNSKI. "FUZZY BI- AND MULTI-PARTITIONING FOR CIRCUITS REPRESENTED BY HYPERGRAPHS." Journal of Circuits, Systems and Computers 06, no. 05 (1996): 503–26. http://dx.doi.org/10.1142/s0218126696000340.

Pełny tekst źródła

Streszczenie:

A new strategy for partitioning hypergraphs in complex LSI and VLSI circuits is presented. A new fuzzy net-cut model has been developed to treat multi-pin-nets without splitting into two-pin-nets. The combinatorial optimization algorithm is derived from statistical physics. The circuit graph is modeled as a highly coupled spin system and the mean field approximation is used to achieve linear time complexity. Fuzzy partitioning enables a qualitative and macroscopic approach by interpreting the mean values of the spin system as fuzzy membership degrees. The proposed strategy is tested with MCNC

Style APA, Harvard, Vancouver, ISO itp.

50

Włodarczyk, André. "Concepts and Categories: A Data Science Approach to Semiotics." Studies in Logic, Grammar and Rhetoric 67, no. 1 (2022): 169–200. http://dx.doi.org/10.2478/slgr-2022-0010.

Pełny tekst źródła

Streszczenie:

Abstract Compared to existing classical approaches to semiotics which are dyadic (signifier/signified, F. de Saussure) and triadic (symbol/concept/object, Ch. S. Peirce), this theory can be characterized as tetradic ([sign/semion]//[object/noema]) and is the result of either doubling the dyadic approach along the semiotic/ordinary dimension or splitting the ‘concept’ of the triadic one into two (semiotic/ordinary). Other important features of this approach are (a) the distinction made between concepts (only functional pairs of extent and intent) and categories (as representations of expression

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!