Edge Mostar Indices of Cacti Graph With Fixed Cycles

Topological invariants are the significant invariants that are used to study the physicochemical and thermodynamic characteristics of chemical compounds. Recently, a new bond additive invariant named the Mostar invariant has been introduced. For any connected graph ℋ, the edge Mostar invariant is described as Moe(ℋ)=∑gx∈E(ℋ)|mℋ(g)−mℋ(x)|, where mℋ(g)(or mℋ(x)) is the number of edges of ℋ lying closer to vertex g (or x) than to vertex x (or g). A graph having at most one common vertex between any two cycles is called a cactus graph. In this study, we compute the greatest edge Mostar invariant for cacti graphs with a fixed number of cycles and n vertices. Moreover, we calculate the sharp upper bound of the edge Mostar invariant for cacti graphs in ℭ(n,s), where s is the number of cycles.

Set And Its Operations

The kind of set which is based on edges, is introduced. The analysis on this set is done in the matter of operation which are the classes of graphs. The general notion which is related to this concept, is up. The set of edges is seen in the matter of common vertex, entitled neighbor edges and the set of edges which has specific condition on the vertices of graphs, entitled ghost set. The kind of viewpoint when the edges are up so the kind of efforts to assign some notions which get the sensible result of edges which make sense about these two types of notions. Notions of having some attributes about vertices concerning edges and edges' attributes to get result about edges in the matter of vertices.

Secondary vertex finding in jets with neural networks

Jet classification is an important ingredient in measurements and searches for new physics at particle colliders, and secondary vertex reconstruction is a key intermediate step in building powerful jet classifiers. We use a neural network to perform vertex finding inside jets in order to improve the classification performance, with a focus on separation of bottom vs. charm flavor tagging. We implement a novel, universal set-to-graph model, which takes into account information from all tracks in a jet to determine if pairs of tracks originated from a common vertex. We explore different performance metrics and find our method to outperform traditional approaches in accurate secondary vertex reconstruction. We also find that improved vertex finding leads to a significant improvement in jet classification performance.

Algebraic Properties of Edge Ideals of Some Vertex-Weighted Oriented Cyclic Graphs

We provide some exact formulas for the projective dimension and regularity of edge ideals associated to some vertex-weighted oriented cyclic graphs with a common vertex or edge. These formulas are functions in the weight of the vertices, and the numbers of edges and cycles. Some examples show that these formulas are related to direction selection and the assumption that [Formula: see text] for any vertex [Formula: see text] cannot be dropped.

Line Graph Associated to Graph of a Near-Ring with Respect to an Ideal

Let N be a near-ring and I be an ideal of N. The graph of N with respect to I is a graph with V (N ) as vertex set and any two distinct vertices x and y are adjacent if and only if xNy ⊆ I oryNx ⊆ I. This graph is denoted by GI(N). We define the line graph of GI(N) as a graph with each edge of GI (N ) as vertex and any two distinct vertices are adjacent if and only if their corresponding edges share a common vertex in the graph GI (N ). We denote this graph by L(GI (N )). We have discussed the diameter, girth, clique number, dominating set of L(GI(N)). We have also found conditions for the graph L(GI(N)) to be acycle graph.

Forcing operators on star graphs applied for the cubic fourth order Schrödinger equation

<p style='text-indent:20px;'>In a recent article [<xref ref-type="bibr" rid="b16">16</xref>], the authors gave a starting point of the study on a series of problems concerning the initial boundary value problem and control theory of Biharmonic NLS in some non-standard domains. In this direction, this article deals to present answers for some questions left in [<xref ref-type="bibr" rid="b16">16</xref>] concerning the study of the cubic fourth order Schrödinger equation in a star graph structure <inline-formula><tex-math id="M1">\begin{document}$ \mathcal{G} $\end{document}</tex-math></inline-formula>. Precisely, consider <inline-formula><tex-math id="M2">\begin{document}$ \mathcal{G} $\end{document}</tex-math></inline-formula> composed by <inline-formula><tex-math id="M3">\begin{document}$ N $\end{document}</tex-math></inline-formula> edges parameterized by half-lines <inline-formula><tex-math id="M4">\begin{document}$ (0,+\infty) $\end{document}</tex-math></inline-formula> attached with a common vertex <inline-formula><tex-math id="M5">\begin{document}$ \nu $\end{document}</tex-math></inline-formula>. With this structure the manuscript proposes to study the well-posedness of a dispersive model on star graphs with three appropriated vertex conditions by using the <i>boundary forcing operator approach</i>. More precisely, we give positive answer for the Cauchy problem in low regularity Sobolev spaces. We have noted that this approach seems very efficient, since this allows to use the tools of Harmonic Analysis, for instance, the Fourier restriction method, introduced by Bourgain, while for the other known standard methods to solve partial differential partial equations on star graphs are more complicated to capture the dispersive smoothing effect in low regularity. The arguments presented in this work have prospects to be applied for other nonlinear dispersive equations in the context of star graphs with unbounded edges.</p>

Line graph of unit graphs associated with finite commutative rings

For a given graph G, its line graph denoted by L(G) is a graph whose vertex set V (L(G)) = E(G) and {e1, e2} ∈ E(L(G)) if e1 and e2 are incident to a common vertex in G. Let R be a finite commutative ring with nonzero identity and G(R) denotes the unit graph associated with R. In this manuscript, we have studied the line graph L(G(R)) of unit graph G(R) associated with R. In the course of the investigation, several basic properties, viz., diameter, girth, clique, and chromatic number of L(G(R)) have been determined. Further, we have derived sufficient conditions for L(G(R)) to be Planar and Hamiltonian

Constructive geometric generating of concave pyramids of fourth sort

The paper presents the results of the study of the new set of polihedra, the Concave pyramids of the fourth sort, the construction procedures for generating them and their possible application. Correspondingly to the method of generating the Concave cupolae of fourth sort, the Concave pyramids of fourth sort have the similar logic of origination, and their counterpart in regular faced convex pyramids. They are characterised by the polygonal base, deltahedral surface net, obtained by folding the planar net of unilateral triangles, the polar distribution of the unit space cells with common apex - the top of the Concave pyramid. Polihedral surface of the planar net of Concave pyramids is produced by polar distribution of unit cells, consisting of a spatial sexagon and spatial pentagon - six, or five, unilateral triangles grouped around the common vertex. In the deltahedral surface, the two neighbouring unit cells are joined by means of a unilateral triangle in the zone of the polygonal base and a spatial quadrangle with which they share common sides. The criterion of face regularity is respected, as well as the criterion of multiple axial symmetry. The sort of the Concave pyramids is determined by the number of equilateral triangle rows in thus obtained polyhedron's net. The parameters of the solids were determined constructively by geometric methods.