Results 11 to 20 of about 451 (94)

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

The Connectivity and the Harary Index of a Graph [PDF]

open access: yes, 2012
The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph.
Das   +17 more
core   +1 more source

Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J.   +4 more
doaj   +1 more source

The agreement distance of unrooted phylogenetic networks [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj   +1 more source

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   +1 more source

A shorter proof of the distance energy of complete multipartite graphs

open access: yesSpecial Matrices, 2017
Caporossi, Chasser and Furtula in [Les Cahiers du GERAD (2009) G-2009-64] conjectured that the distance energy of a complete multipartite graph of order n with r ≥ 2 parts, each of size at least 2, is equal to 4(n − r).
So Wasin
doaj   +1 more source

On Topological Indices of mth Chain Hex-Derived Network of Third Type

open access: yesFrontiers in Physics, 2020
In theoretical chemistry, the numerical parameters that are used to characterize the molecular topology of graphs are called topological indices. Several physical and chemical properties like boiling point, entropy, heat formation, and vaporization ...
Yuhong Huo   +5 more
doaj   +1 more source

Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions [PDF]

open access: yes, 2017
Fractional minimum positive semidefinite rank is defined from r-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement.
Hogben, L   +3 more
core   +1 more source

Existence of Regular Nut Graphs for Degree at Most 11

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W.   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy