Results 51 to 60 of about 87,339 (166)
The M-polynomial of line graph of subdivision graphs
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2019 Summary: Three composite graphs Ladder graph \((L_n)\), Tadpole graph \((T_{n,k})\) and Wheel graph \((W_n)\) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc. In this report, we first determine \(M\)-polynomial of the Line graph of those three graphs using subdivision idea and then compute ...
Mondal, Sourav, De, Nilanjan, Pal, Anita
openaire +5 more sources
Roman game domination subdivision number of a graph [PDF]
Transactions on Combinatorics, 2013 A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a
Jafar Amjadi +3 more
doaj
Topological properties of Graphene using some novel neighborhood degree-based topological indices
International Journal of Mathematics for Industry, 2019 Topological indices are numeric quantities that transform chemical structure to real number. Topological indices are used in QSAR/QSPR studies to correlate the bioactivity and physiochemical properties of molecule.
Sourav Mondal, Nilanjan De, Anita Pal
doaj +1 more source
The partition dimension of a subdivision of a homogeneous firecracker
Electronic Journal of Graph Theory and Applications, 2020 Finding the partition dimension of a graph is one of the interesting (and uncompletely solved) problems of graph theory. For instance, the values of the partition dimensions for most kind of trees are still unknown. Although for several classes of trees
Amrullah Amrullah
doaj +1 more source
Scott's induced subdivision conjecture for maximal triangle-free graphs
, 2011 Scott conjectured that the class of graphs with no induced subdivision of a given graph is $\chi$-bounded.
Bousquet, Nicolas, Thomassé, Stéphan
core +2 more sources
Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph
Complexity, 2020 Continuous subgraph matching problem on dynamic graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including information retrieval and community detection. Specifically, given a query graph q,
Yunhao Sun +3 more
doaj +1 more source
Numerous graph energies of regular subdivision graph and complete graph
AIMS Mathematics, 2021 The graph energy $ E(G) $ of a simple graph $ G $ is sum of its absolute eigenvalues where eigenvalues of adjacency matrix $ A(G) $ are referred as eigenvalues of graph $ G $. Depends upon eigenvalues of different graph matrices, several graph energies has been observed recently such as maximum degree energy, Randi$ \acute{c} $ energy, sum-connectivity
Imrana Kousar +4 more
openaire +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2017 The general sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graphs of subdivision graphs of tadpole graphs, wheels and ladders have been reported in the literature.
Harishchandra S. Ramane +2 more
doaj +1 more source
Divisible subdivisions of graphs in subdivisions of complete graphs
28 ...
Hou, Xinmin, Wang, Xiangyang
openaire +2 more sources
Eternal m-security subdivision numbers in trees [PDF]
Communications in Combinatorics and Optimization, 2019 An eternal $m$-secure set of a graph $G = (V,E)$ is a set $S_0\subseteq V$ that can defend against any sequence of single-vertex attacks by means of multiple-guard shifts along the edges of $G$. A suitable placement of the guards is called an eternal
M. Atapour
doaj +1 more source