Evaluation of synbiotics as gut health improvement agents against Shiga toxin-producing Escherichia coli isolated from the pig

Colibacillosis is one of the major health problems in young piglets resulting in poor health and death caused by Escherichia coli producing F18 pili and Shiga toxin 2e. It is pivotal to reduce colibacillosis in weaned piglets to enhance production performance. In this study, we evaluated synbiotics as the gut health improvement agents in the mouse model challenged with Shiga toxin-producing E. coli (STEC) isolated from piglets. Prebiotic lactulose was formulated with each 5.0 × 106 CFU/mL of Pediococcus acidilactici GB-U15, Lactobacillus plantarum GB-U17, and Lactobacillus plantarum GB 1-3 to produce 3 combinations of synbiotics. A total of 40 three weeks old BALB/c mice were randomly assigned to 4 groups (n = 10): a control group and 3 synbiotics treated groups. Each treatment groups were daily administrated with 5.0 × 106 CFU/mL of one synbiotics for the first week, and every 3 days during the second week. All the mice were challenged with 8.0 × 108 CFU/mL of STEC 5 days after animals began to receive synbiotics. Mice treated with synbiotics based on Pediococcus acidilactici GB-U15 and Lactobacillus plantarum GB-U17 significantly improved daily weight gain compared to mice in other groups. While mice treated with GB-U15 showed better fecal index, no significant differences were observed among groups. Gross lesion and histopathological evaluations showed that mice treated with GB-U15 moderately improved recovery from STEC infection. In conclusion, our results suggest that the synbiotics formulated with lactulose and Pediococcus acidilactici GB-U15 have potential benefits to prevent and improve colibacillosis in weaned piglets

Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order

[[abstract]]For every integer n≥4, it is proved that there is a unique graph of order n which maximizes the spectral radius of the unoriented Laplacian matrix over all bicyclic graphs of order n, namely, the graph obtained from the cycle C 4 by first adding a chord and then attaching n − 4 pendant edges to one end of the chord.[[notice]]補正完畢[[journaltype]]國外[[incitationindex]]SC