Results 11 to 20 of about 95 (92)

Some Characteristics of the Prime Graph of Integer Modulo Groups [PDF]

open access: yesInPrime, 2023
The notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are ...
Muklas Maulana   +3 more
doaj   +2 more sources

Social Network Analysis of Twitter Users on BTS Topic Using Degree Centrality, Betweenness Centrality, and Closeness Centrality

open access: yesInPrime, 2023
Nowadays, a trademark is starting to be built through content on social media by involving influencers whose roles are increasingly needed in digital marketing. Hence, finding them on social media networks is an important thing. In brand recognition, BTS
Siti Adniati   +2 more
doaj   +2 more sources

Span of a Graph: Keeping the Safety Distance [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2023
Inspired by Lelek's idea from [Disjoint mappings and the span of spaces, Fund. Math. 55 (1964), 199 -- 214], we introduce the novel notion of the span of graphs.
Iztok Banič, Andrej Taranenko
doaj   +1 more source

Evaluation of the effects of chlorhexidine digluconate with and without cBD103 or cCath against multidrug‐resistant clinical isolates of Staphylococcus pseudintermedius

open access: yesVeterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022
Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro   +3 more
wiley   +1 more source

Correlations in totally symmetric self‐complementary plane partitions

open access: yesTransactions of the London Mathematical Society, Volume 8, Issue 1, Page 493-526, December 2021., 2021
Abstract Totally symmetric self‐complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well‐known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in 1/12 of a hexagon with free boundary to express them as perfect matchings of a family of non‐bipartite planar graphs ...
Arvind Ayyer, Sunil Chhita
wiley   +1 more source

Computational and topological properties of neural networks by means of graph-theoretic parameters

open access: yesAlexandria Engineering Journal, 2023
A neural network is a computer system modeled on the nerve tissue and nervous system. In this sense, neural networks refer to systems of neurons, either organic or artificial in nature.
Asad Khan   +5 more
doaj   +1 more source

The multiplicative Zagreb indices of graph operations [PDF]

open access: yes, 2013
Recently, Todeschini et al. (Novel Molecular Structure Descriptors - Theory and Applications I, pp. 73-100, 2010), Todeschini and Consonni (MATCH Commun. Math. Comput. Chem.
Das, Kinkar C., Çevik, Ahmet Sinan
core   +2 more sources

On vertex PI index of certain triangular tessellation networks

open access: yesMain Group Metal Chemistry, 2021
The Wiener index, due to its many applications is considered to be one of very important distance-based index. But the Padmaker-Ivan (PI) index is kind of the only distance related index linked to parallelism of edges.
Bokhary Syed Ahtsham Ul Haq, Adnan
doaj   +1 more source

The Compared Costs of Domination Location-Domination and Identification

open access: yesDiscussiones Mathematicae Graph Theory, 2020
Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V, let Br(v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V, we have Br(v) ∩ C ≠ ∅; it is an r-locating-dominating code
Hudry Olivier, Lobstein Antoine
doaj   +1 more source

Under which conditions is λ″(G)=κ″(L(G))?

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
In this paper we show that if G is a connected graph such that [Formula: see text], [Formula: see text] and [Formula: see text] then [Formula: see text] exists and [Formula: see text] if and only if G is not super-[Formula: see text]. We also obtain some
Farnaz Soliemany   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy