Results 31 to 40 of about 891,390 (207)
, 2021 A directed cyclic graph is a directed graph that has at least one directed cycle graph, that is a cycle graph in which all edges are oriented, so that the direction passes through each vertex once, except the end of vertex. The directed unicyclic tadpole
Qomaruzzaman, S. Aminah, K. Sugeng
semanticscholar +1 more source
Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023 In chemistry and medical sciences, it is essential to study the chemical, biological, clinical, and therapeutic aspects of pharmaceuticals. To save time and money, mathematical chemistry focuses on topological indices used in quantitative structure‐property relationship (QSPR) models to predict the properties of chemical structures.
Vignesh Ravi +6 more
wiley +1 more source
Some algebraic invariants of the edge ideals of perfect [h,d]-ary trees and some unicyclic graphs
AIMS Mathematics, 2023 This article is mainly concerned with computations of some algebraic invariants of quotient rings of edge ideals of perfect [h,d]-ary trees and unicyclic graphs. We compute exact values of depth and Stanley depth and consequently projective dimension for
Tazeen Ayesha, Muhammad Ishaq
doaj +1 more source
Some Characterizations and NP‐Complete Problems for Power Cordial Graphs
Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023 A power cordial labeling of a graph G = (V(G), E(G)) is a bijection f : V(G)⟶{1,2, …, |V(G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))n or f(v) = (f(u))n, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.
C. M. Barasara, Y. B. Thakkar, Akbar Ali
wiley +1 more source
Local Fractional Strong Metric Dimension of Certain Complex Networks
Complexity, Volume 2023, Issue 1, 2023., 2023 Fractional variants of distance‐based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems. Complex networks are exceptional networks which exhibit significant topological features and have become quintessential research area in the field of computer science, biology, and mathematics.
Faiza Jamil +4 more
wiley +1 more source
Journal of Function Spaces, Volume 2023, Issue 1, 2023., 2023 There has been an upsurge of research on complex networks in recent years. The purpose of this paper is to study the mathematical properties of the random pentagonal chain networks PECn with the help of graph theory. Based on the networks PECn, we first obtain the expected value expressions of the Gutman index, Schultz index, multiplicative degree ...
Jia-Bao Liu +3 more
wiley +1 more source
The local metric dimension of split and unicyclic graphs
Indonesian Journal of Combinatorics, 2022 A set W is called a local resolving set of G if the distance of u and v to some elements of W are distinct for every two adjacent vertices u and v in G. The local metric dimension of G is the minimum cardinality of a local resolving set of G.
Dinny Fitriani +3 more
doaj +1 more source
On the first and second Zagreb indices of quasi unicyclic graphs [PDF]
Transactions on Combinatorics, 2019 Let $G$ be a simple graph. The graph $G$ is called a quasi unicyclic graph if there exists a vertex $x \in V(G)$ such that $G-x$ is a connected graph with a unique cycle. Moreover, the first and the second Zagreb indices of $G$ denoted by $M_1(G)$
Majid Aghel +2 more
doaj +1 more source
On super vertex-graceful unicyclic graphs [PDF]
Czechoslovak Mathematical Journal, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Sin-Min, Leung, Elo, Ng, Ho Kuen
openaire +1 more source
Minor-obstructions for apex sub-unicyclic graphs [PDF]
Discrete Applied Mathematics, 2020 A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the class of $1$-apex sub-unicyclic graphs, i.e., the set of all minor minimal graphs that do not belong in this class.
Leivaditis, A. +5 more
openaire +4 more sources