LIVIVO - Search results -

Search results

Result 1 - 10 of total 15

Search options

Article ; Online: Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations

Muhammad Faisal Nadeem / Ayesha Shabbir / Muhammad Imran

Complexity, Vol

2023 Volume 2023

Abstract: Optimal graph embeddings represent graphs in a lower dimensional space in a way that preserves the structure and properties of the original graph. These techniques have wide applications in fields such as machine learning, data mining, and network ... ...

Abstract	Optimal graph embeddings represent graphs in a lower dimensional space in a way that preserves the structure and properties of the original graph. These techniques have wide applications in fields such as machine learning, data mining, and network analysis. Do we have small (if possible minimal) k-connected graphs with the property that for any j vertices there is a longest path avoiding all of them? This question of Zamfirescu (1972) was the first variant of Gallai’s question (1966): Do all longest paths in a connected graph share a common vertex? Several good examples answering Zamfirescu’s question are known. In 2001, he asked to investigate the family of geometrical lattices with respect to this property. In 2017, Chang and Yuan proved the existence of such graphs in Archimedean tiling. Here, we prove that the graphs presented by Chang and Yuan are not optimal by constructing such graphs of sufficiently smaller orders. The problem of finding nonconcurrent longest paths in Archimedean tessellations refers to finding paths in a lattice such that the paths do not overlap or intersect with each other and are as long as possible. The complexity of embedding graph is still unknown. This problem can be challenging because it requires finding paths that are both long and do not intersect, which can be difficult due to the constraints of the lattice structure.
Keywords	Electronic computers. Computer science ; QA75.5-76.95
Subject code	511
Language	English
Publishing date	2023-01-01T00:00:00Z
Publisher	Hindawi-Wiley
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: Topological aspects of extended Sierpiński structures with help of underlying networks

Faiza Ishfaq / Muhammad Imran / Muhammad Faisal Nadeem

Journal of King Saud University: Science, Vol 34, Iss 6, Pp 102126- (2022)

2022

Abstract: Sierpiński networks are the most studied networks of fractal nature with applications in various fields of science. A generalized Sierpiński network is obtained by copying the base network, resulting in the self-similar network. The extended Sierpiński ... ...

Abstract	Sierpiński networks are the most studied networks of fractal nature with applications in various fields of science. A generalized Sierpiński network is obtained by copying the base network, resulting in the self-similar network. The extended Sierpiński networks are obtained by introducing a new vertex in a generalized Sierpiński network and attaching this vertex with the extreme vertices. Certain network invariants are used to find thermodynamic properties, physio-chemical properties, and biological activities of chemical compounds. These network invariants play a dynamic role in QSAR/QSPR study. In this paper, we discussed Zagreb indices and forgotten topological index for extended Sierpiński networks by using any base network H. Moreover, for the studied topological indices, we attained some bounds using different parameters i.e. order, size, maximum and minimum degrees of vertices in network H.
Keywords	Zagreb indices ; Forgotten index ; Extended Sierpiński networks ; Extremal networks ; Science (General) ; Q1-390
Subject code	000
Language	English
Publishing date	2022-08-01T00:00:00Z
Publisher	Elsevier
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: Sharp bounds on partition dimension of hexagonal Möbius ladder

Muhammad Azeem / Muhammad Imran / Muhammad Faisal Nadeem

Journal of King Saud University: Science, Vol 34, Iss 2, Pp 101779- (2022)

2022

Abstract: Complex networks are not easy to decode and understand to work on it, similarly, the Möbius structure is also considered as a complex structure or geometry. But making a graph of every complex and huge structure either chemical or computer-related ... ...

Abstract	Complex networks are not easy to decode and understand to work on it, similarly, the Möbius structure is also considered as a complex structure or geometry. But making a graph of every complex and huge structure either chemical or computer-related networks becomes easy. After making easy of its construction, recognition of each vertex (node or atom) is also not an easy task, in this context resolvability parameters plays an important role in controlling or accessing each vertex with respect to some chosen vertices called as resolving set or sometimes dividing entire cluster of vertices into further subparts (subsets) and then accessing each vertex with respect to build in subsets called as resolving partition set. In these parameters, each vertex has its own unique identification and is easy to access despite the small or huge structures. In this article, we provide a resolving partition of hexagonal Möbius ladder graph and discuss bounds of partition dimension of hexagonal Möbius ladder network.
Keywords	Möbius ladder graph ; Partition dimension ; Partition resolving sets ; Bounds of partition dimension ; Science (General) ; Q1-390
Subject code	511
Language	English
Publishing date	2022-02-01T00:00:00Z
Publisher	Elsevier
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: Partition Dimension of Generalized Petersen Graph

Hassan Raza / Jia-Bao Liu / Muhammad Azeem / Muhammad Faisal Nadeem

Complexity, Vol

2021 Volume 2021

Abstract: Let G=VG,EG be the connected graph. For any vertex i∈VG and a subset B⊆VG, the distance between i and B is di;B=mindi,j|j∈B. The ordered k-partition of VG is Π=B1,B2,…,Bk. The representation of vertex i with respect to Π is the k-vector, that is, ri|Π=di, ...

Abstract	Let G=VG,EG be the connected graph. For any vertex i∈VG and a subset B⊆VG, the distance between i and B is di;B=mindi,j\|j∈B. The ordered k-partition of VG is Π=B1,B2,…,Bk. The representation of vertex i with respect to Π is the k-vector, that is, ri\|Π=di,B1,di,B2,…,di,Bk. The partition Π is called the resolving (distinguishing) partition if ri\|Π≠rj\|Π, for all distinct i,j∈VG. The minimum cardinality of the resolving partition is called the partition dimension, denoted as pdG. In this paper, we consider the upper bound for the partition dimension of the generalized Petersen graph in terms of the cardinalities of its partite sets.
Keywords	Electronic computers. Computer science ; QA75.5-76.95
Language	English
Publishing date	2021-01-01T00:00:00Z
Publisher	Hindawi-Wiley
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: Bounds on the partition dimension of one pentagonal carbon nanocone structure

Ali N.A. Koam / Ali Ahmad / Muhammad Azeem / Muhammad Faisal Nadeem

Arabian Journal of Chemistry, Vol 15, Iss 7, Pp 103923- (2022)

2022

Abstract: The partition dimension is the most complicated resolving parameter of all the resolvability parameters. In this parameter, the vertex set of a graph is completely subdivided into subsets so that each vertex of a graph has a unique identification in ... ...

Abstract	The partition dimension is the most complicated resolving parameter of all the resolvability parameters. In this parameter, the vertex set of a graph is completely subdivided into subsets so that each vertex of a graph has a unique identification in terms of the partitioning of its selected subsets. In this paper, we consider Carbon nanocone structure (CNC) more specifically one pentagonal carbon nanocone CNCζ,5. It is also regarded as a useful structure in terms of various applications. To delve deeper into this structure, we provide a graphical representation of it and identified sharp bounds for the partition dimension. We conclude that the pentagonal carbon nanocone CNCζ,5 has partition dimension ≤4.
Keywords	One pentagonal carbon nanocone ; Partition dimension ; Bounds on the partition dimension ; Resolving partition set ; Chemistry ; QD1-999
Language	English
Publishing date	2022-07-01T00:00:00Z
Publisher	Elsevier
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: A pilot study on the advancement of livestock healthcare bio-capsules and development of customized long-range network in the United Arab Emirates

Khaja Mohteshamuddin / Heejin Kim / Seunghwan Lee / Hanseok Kang / Leo Marlon Estrada / Muhammad Faisal Nadeem / Mohamed Elfatih Hamad / Abdullah Dakheel

Smart Agricultural Technology, Vol 3, Iss , Pp 100082- (2023)

1480

Abstract: The UAE's environment is characterized by low rainfall, high temperatures, poor soil and lack of natural waterways. The country has been making tremendous efforts to build a sustainable agricultural and animal wealth sector that is better able to ... ...

Abstract	The UAE's environment is characterized by low rainfall, high temperatures, poor soil and lack of natural waterways. The country has been making tremendous efforts to build a sustainable agricultural and animal wealth sector that is better able to contribute to its national agenda of food security. Commercial cattle farming in such challenging conditions would require an effective disease prediction and warning system for optimizing the production dynamics. Therefore, we are proposing the use of smart livestock system comprising of orally ingested bio-capsules for monitoring the livestock health, connected through a customized long-range network (430 MHz) in the United Arab Emirates, which monitors the real time animal body condition data (temperature and body activity) using a mobile or web-based application. The study demonstrated a 100% success rate in estrus alarms in the test animals, 61.29% for calving alerts and an accurate disease prediction warning in all the animals diagnosed unhealthy. the conception rate in these estrus diagnosed animals with artificial insemination was 61.53%, which was significantly higher than the conception rate in the absence of this detection technology at the farm. The capsule was well tolerated in all the test animals and did not show any acute adverse or allergic reactions. This is the first of its kind of study using these advanced bio-capsules and development of the customized long-range network in the United Arab Emirates for smart livestock healthcare management.
Keywords	Bio-capsule ; Cattle ; Health management ; Livestock healthcare ; LoRa network ; Agriculture (General) ; S1-972 ; Agricultural industries ; HD9000-9495
Subject code	630
Language	English
Publishing date	2023-02-01T00:00:00Z
Publisher	Elsevier
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks

Hua Wang / Muhammad Azeem / Muhammad Faisal Nadeem / Ata Ur-Rehman / Adnan Aslam

Complexity, Vol

2021 Volume 2021

Abstract: In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an ...

Abstract	In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an arbitrary vertex stopped working and selected vertices still remain the resolving set, then the chosen set is called as the fault-tolerant resolving set. The least number of vertices in such resolving sets is called the fault-tolerant metric dimension of the network. Because of the variety of applications of the metric dimension in different areas of sciences, many generalizations were proposed, and fault tolerant is one of them. In this paper, we computed the fault-tolerant metric dimension of triangular snake, ladder, Mobius ladder, and hexagonal ladder networks. It is important to observe that, in all these classes of networks, the fault-tolerant metric dimension and metric dimension differ by 1.
Keywords	Electronic computers. Computer science ; QA75.5-76.95
Subject code	511
Language	English
Publishing date	2021-01-01T00:00:00Z
Publisher	Hindawi-Wiley
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: COVID-19 and non-COVID-19 pneumonia

Aamer Ali Khattak / Usman Ayub Awan / Muhammad Sohail Afzal / Muhammad Faisal Nadeem

Journal of the Formosan Medical Association, Vol 120, Iss 7, Pp 1535-

Alarming synergism for Pakistan's overwhelmed healthcare system

2021 Volume 1536

Keywords	Medicine (General) ; R5-920
Language	English
Publishing date	2021-07-01T00:00:00Z
Publisher	Elsevier
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: Topological aspects of metal-organic structure with the help of underlying networks

Muhammad Faisal Nadeem / Muhammad Imran / Hafiz Muhammad Afzal Siddiqui / Muhammad Azeem / Adnan Khalil / Yasir Ali

Arabian Journal of Chemistry, Vol 14, Iss 6, Pp 103157- (2021)

2021

Abstract: Metal–organic structures/Networks (MONs) are useful in modern chemistry. It is common to use as a storehouse for the storage of gases, it plays a role in the separation of gases and purification. The most important feature of MONs is that it acts as a ... ...

Abstract	Metal–organic structures/Networks (MONs) are useful in modern chemistry. It is common to use as a storehouse for the storage of gases, it plays a role in the separation of gases and purification. The most important feature of MONs is that it acts as a predecessor for the development of a large number of nanostructures. Furthermore, MONs reflect very useful chemical-physical properties, changing organic ligands, exchanging of ions, etc. The method used to forecast the natural behaviors among the chemical-physical specifications of the chemical compounds in their primitive network is known as topological indices or TIs. This numerical quantity is used in the method of forecasting. TIs of MONs shows a key role in the environmental and theoretical pharmacology and chemistry. Line graphs also have powerful applications in chemistry and predicting the boiling point of cycloalkanes. In this paper, we study Randić, atom bound connectivity, geometric arithmetic, Zagreb, Multiplicative Zagreb, redefined Zagreb indices and Zagreb coindices for line graph of first organic network L(MON1(χ)) and second organic network L(MON2(χ)),χ⩾2.
Keywords	Metal–organic network ; Chemical compounds ; Topological indices ; Line graph ; Chemistry ; QD1-999
Subject code	540
Language	English
Publishing date	2021-06-01T00:00:00Z
Publisher	Elsevier
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: A comprehensive assessment of phytochemicals from Phyla nodiflora (L.) Greene as a potential enzyme inhibitor, and their biological potential

Ahmed Alafnan / Muhammad Faisal Nadeem / Syed Faraz Ahmad / Muhammad Sarfraz / Abdulwahab Aalamri / Nasrin E Khalifa / Alasmari Saeed Abdullah / Ali Murtaza / Muhammad Danish / Irshad Ahmad / Riaz Hussain / Marcello Locatelli / Umair Khurshid / Nafees Ahemad / Hammad Saleem

Arabian Journal of Chemistry, Vol 16, Iss 11, Pp 105233- (2023)

An in-silico, in-vivo, and in-vitro approach

2023

Abstract: This work explored Phyla nodiflora (L.) Greene as a potential source of the bioactive medicinal agent. In this aspect, methanol (PN-M) and dichloromethane (PN-D) extracts were prepared from the whole plant and evaluated for phytochemical composition ( ... ...

Abstract	This work explored Phyla nodiflora (L.) Greene as a potential source of the bioactive medicinal agent. In this aspect, methanol (PN-M) and dichloromethane (PN-D) extracts were prepared from the whole plant and evaluated for phytochemical composition (total bioactive contents, UHPLC-MS analysis, and HPLC-PDA polyphenolic quantification), biological (antioxidant and enzyme inhibition) potential and in-vivo toxicity. The PN-M was found to contain higher phenolic (26.08 mg GAE/g extract) and flavonoid (50.25 mg QE/g extract) contents which might correlate to the higher radical scavenging (DPPH: 52.94 mg TE/g extract; ABTS: 72.11 mg TE/g extract) and reducing power (FRAP: 71.96 mg TE/g extract; CUPRAC: 142.65 mg TE/g extract) antioxidant potential, as well as AChE (4.33 mg GALAE/g extract), tyrosinase (125.36 mg KAE/g extract), and amylase (1.86 mmol ACAE/g extract) inhibition activity of this extract. In contrast, the PN-D extract was found to be most active for phosphomolybdenum (1.30 mg TE/ g extract) and metal chelation (54.84 mg EDTAE/g extract) assays in addition to BChE (4.70 mg GALAE/g extract) and glucosidase (0.62 mmol ACAE/g extract) enzyme inhibition activity. The PN-M extract on UHPLC-MS analysis revealed the tentative identification of 24 different secondary metabolites, most of which belonged to the flavonoid, glycoside, and terpenoid classes of phytochemicals. The polyphenolic composition of the extracts was appraised by HPLC-PDA. Seven phenolic compounds were identified in the extracts. PN-M was found to be rich in catechin (0.25 µg/extract) and 3-OH benzoic acid (0.64 µg/extract), while PN-D contained epicatechin (0.30 µg/extract), 3-OH-4-MeO benzaldehyde (0.21 µg/extract), and 2,3-Di-Meo benzoic acid (0.97 µg/extract) in higher amounts. The methanol extract was found to be non-toxic even at higher doses. Furthermore, the relationship between the phytochemicals and the tested enzymes was highlighted by molecular docking studies. In sum, this research showed that the studied extracts were effective ...
Keywords	Phyla nodiflora ; Phytochemicals ; Antioxidant ; Enzyme inhibition ; Toxicity ; HPLC ; Chemistry ; QD1-999
Subject code	500
Language	English
Publishing date	2023-11-01T00:00:00Z
Publisher	Elsevier
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

To top

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED