Independence and Matching Numbers of Unicyclic Graphs From Null Space
We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees. These formulas allows one to compute independence and matching numbers of unicyclic graphs using linear algebra methods.
NurtureToken New!

Token crowdsale for this paper ends in

Buy Nurture Tokens

Authors

Are you an author of this paper? Check the Twitter handle we have for you is correct.

Luiz Emilio Allem (add twitter)
Daniel Alejandro Jaume (add twitter)
Gonzalo Molina (edit)
Maikon Machado Toledo (add twitter)
Vilmar Trevisan (add twitter)
Category

Mathematics - Combinatorics

Subcategories
-
Ask The Authors

Ask the authors of this paper a question or leave a comment.

Read it. Rate it.
#1. Which part of the paper did you read?

#2. The paper contains new data or analyses that is openly accessible?
#3. The conclusion is supported by the data and analyses?
#4. The conclusion is of scientific interest?
#5. The result is likely to lead to future research?

Github
User:
None (add)
Repo:
None (add)
Stargazers:
0
Forks:
0
Open Issues:
0
Network:
0
Subscribers:
0
Language:
None
Youtube
Link:
None (add)
Views:
0
Likes:
0
Dislikes:
0
Favorites:
0
Comments:
0
Other
Sample Sizes (N=):
Inserted:
Words Total:
Words Unique:
Source:
Abstract:
None
07/17/19 06:01PM
7,741
1,391
Tweets
mathCObot: Luiz Emilio Allem, Daniel Alejandro Jaume, Gonzalo Molina, Maikon Machado Toledo, Vilmar Trevisan : Independence and Matching Numbers of Unicyclic Graphs From Null Space https://t.co/1C4CBVYTo2 https://t.co/e1rci3g5SY
Images
Related