Automatic route choice in telecommunication networks using external management systems, also known as transport networks, is an unsatisfactorily solved problem. The task can be reduced to weighting and choosing routes in a directed graph starting with weighting edges and vertices using sets of very different parameters, parameters depending on technical and economic conditions. An essential pro...

In classical graph theory, the minimal spanning tree (MST) is a subgraph with no cycles that connects each vertex minimum edge weights. Calculating of has always been common problem throughout ages. Fuzzy (FMST) able to handle uncertainty existing in weights for fuzzy which occurs real world situations. this article, we have studied MST directed and undirected whose are represented by fermatean...

This document is divided into three sections. Section 2 adds some clarifications regarding filtering grayscale images from the dataset, along with additional details about the network architecture. Section 3 contains a discussion of our algorithm in comparison to Cheng et al. [1]. Section 4 contains a more detailed explanation of the VGG category analysis presented in Section 4.1 and Figure 8 o...

Abstract Cryptophytes are flagellated, eukaryotic phytoplankton found in environments ranging from tea-colored ponds to the blue-water open ocean. vary color green red, a trait that is imparted primarily by their phycobiliprotein (PBP) accessory pigments. These PBPs have likely played key role diversification of cryptophytes into wide range aquatic over evolutionary history. This review covers ...

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...

in this paper, at first we mention to some results related to pi and vertex co-pi indices and then we introduce the edge versions of co-pi indices. then, we obtain some properties about these new indices.

a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...