Javascript must be enabled to continue!
The Complexity of Pencil Graph and Line Pencil Graph
View through CrossRef
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. The number of spanning trees in graph ????, also called the complexity of the graph ????, represented by τ(????), is the total number of distinct spanning trees of graph ????. This research aims to formulate the complexity of pencil graph and line pencil graph. In this research, the complexity of pencil graph and line pencil graph are determined using graph complement approach. The result of the research are the complexity of pencil graph and line pencil graph.
Universitas Negeri Yogyakarta
Title: The Complexity of Pencil Graph and Line Pencil Graph
Description:
Let ???? be a linked and undirected graph.
Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????.
The number of spanning trees in graph ????, also called the complexity of the graph ????, represented by τ(????), is the total number of distinct spanning trees of graph ????.
This research aims to formulate the complexity of pencil graph and line pencil graph.
In this research, the complexity of pencil graph and line pencil graph are determined using graph complement approach.
The result of the research are the complexity of pencil graph and line pencil graph.
Related Results
Complexity Theory
Complexity Theory
The workshop
Complexity Theory
was organised by Joachim von zur Gathen (Bonn), Oded Goldreich (Rehovot), Claus-Peter Schnorr (Frankfurt), and Madhu Sudan ...
Linguistic Complexity
Linguistic Complexity
Linguistic complexity (or: language complexity, complexity in language) is a multifaceted and multidimensional research area that has been booming since the early 2000s. The curren...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Information Technology and the Complexity Cycle
Information Technology and the Complexity Cycle
Aim/Purpose: In this paper we propose a framework identifying many of the unintended consequences of information technology and posit that the increased complexity brought about by...
Assessment of Construction Project Complexity
Assessment of Construction Project Complexity
Objective:Project complexity is a crucial factor in project management that presents auxiliary obstacles to reaching project objectives (cost, time, safety, and quality). This stud...
Book of paintings made in Portugal and Spain
Book of paintings made in Portugal and Spain
IE TCD MS 6208 is one of 5 sketchbooks kept by John Synge during his early 19th-century European travels. Where the works are finished they are sepia wash depictions of buildings i...

