Results 221 to 230 of about 14,956 (263)

Topological indices of the subdivision graph and the line graph of subdivision graph of the wheel graph

Journal of Discrete Mathematical Sciences and Cryptography, 2021
Topological index is a useful number associated with molecular graph and the number correlate certain physico-chemical properties of chemical compounds.
Melaku Berhe Belay, Chunxiang Wang, Abdul Jalil M. Khalaf, Hamid Hosseini, Mohammad Reza Farahani   +4 more
openaire   +1 more source

Paired-Domination Subdivision Numbers of Graphs

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Favaron, O., Karami, H., Sheikholeslami, S. M.   +2 more
openaire   +2 more sources

Zk-Magic labeling of subdivision graphs

Discrete Mathematics, Algorithms and Applications, 2016
For any nontrivial abelian group [Formula: see text] under addition a graph [Formula: see text] is said to be [Formula: see text]-magic if there exists a labeling [Formula: see text] such that the vertex labeling [Formula: see text] defined as [Formula: see text] taken over all edges [Formula: see text] incident at [Formula: see text] is a constant ...
P. Jeyanthi, K. Jeya Daisy
openaire   +1 more source

Characteristic polynomials of subdivision graphs

2021
Summary: Energy of a graph, firstly defined by E. Hückel is an important sub area of graph theory with numerous applications in Chemistry and Physics together with all areas they are used as fundamental methods. Schrödinger equation is a second order differential equation which include the energy of the corresponding system. Subdivision of a graph is a
DEMİRCİ, MUSA, CANGÜL, İSMAİL NACİ, ANA, UĞUR, DELEN, SADIK, ÇELİK, FERİHA   +4 more
openaire   +2 more sources

$K_5^-$-Subdivision in 4-Connected Graphs

SIAM Journal on Discrete Mathematics, 2018
Summary: Hajós conjectured that every \(k\)-chromatic graph contains a \(K_k\)-subdivision. In this paper, we consider the subdivision of \(K_5^-\) and prove that every 4-connected graph contains a \(K_5^-\)-subdivision. This may make progress for the case \(k=5\) of the Hajós' conjecture.
Lu, Changhong, Zhang, Ping
openaire   +2 more sources

VERTEX WEIGHTED WIENER POLYNOMIALS OF THE SUBDIVISION GRAPH AND THE LINE GRAPH OF SUBDIVISION GRAPH OF THE WHEEL GRAPH

Advances and Applications in Discrete Mathematics, 2019
Summary: The Wiener index of a graph \(G\) is the sum of all distances between distinct vertices of the graph \(G\). Singly and doubly vertex weighted Wiener polynomials are generalizations of both vertex weighted Wiener numbers and the ordinary Wiener polynomial.
Ahmad, Zaheer, Jamil, Muhammad, Farahani, Mohammad, Naduvath, Sudev, Siddiqui, Muhammad   +4 more
openaire   +1 more source

Complexity of subdivision-vertex and subdivision-edge join graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2021
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph. The generalized graph entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements of the graph.
openaire   +2 more sources

Subdivisions, parity and well-covered graphs

Journal of Graph Theory, 1997
A graph is well covered if all its maximal independent sets are of the same cardinality. Deciding whether a given graph is well covered is known to be NP-hard in general. A graph \(G\) is called 2-degenerate if for any induced subgraph \(H\) of \(G\), the minimum degree of \(H\) is at most two.
openaire   +2 more sources

Energy of Vertices of Subdivision Graphs

Match Communications in Mathematical and in Computer Chemistry
Summary: The energy of a vertex \(v_i\) in a graph \(G\) is \(\mathcal{E}_G (v_i) = |A|_{ii}\), where \(A\) is the adjacency matrix of \(G\), and \(|A| = (AA^*)^{1/2}\). The graph energy is then \(\mathcal{E}(G) = \mathcal{E}_G (v_1) + \mathcal{E}_G (v_2) + \cdots + \mathcal{E}_G (v_n)\).
Harishchandra S. Ramane, Sheena Y. Chowri, Thippeswamy Shivaprasad, Ivan Gutman   +3 more
openaire   +2 more sources

Disjunctive Total Domination Subdivision Number of Graphs

Fundamenta Informaticae, 2020
A set S ⊆ V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it. The disjunctive total domination number is the minimum cardinality of a disjunctive total dominating set in G. We define the disjunctive total domination subdivision number of G as the minimum number of
Ciftci, Canan, Aytac, Vecdi
openaire   +3 more sources